./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:42:19,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:42:19,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:42:19,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:42:19,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:42:19,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:42:19,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:42:19,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:42:19,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:42:19,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:42:19,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:42:19,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:42:19,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:42:19,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:42:19,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:42:19,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:42:19,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:42:19,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:42:19,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:42:19,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:42:19,161 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:42:19,165 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:42:19,165 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:42:19,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:42:19,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:42:19,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:42:19,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:42:19,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:42:19,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:42:19,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:42:19,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:42:19,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:42:19,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:42:19,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:42:19,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:42:19,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:42:19,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:42:19,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:42:19,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:42:19,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:42:19,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:42:19,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:42:19,171 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2024-11-17 00:42:19,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:42:19,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:42:19,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:42:19,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:42:19,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:42:19,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-17 00:42:20,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:42:21,196 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:42:21,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-17 00:42:21,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7494c3d73/9f9565b1d6a4481b9d4359930aa3b220/FLAGcfd769a6c [2024-11-17 00:42:21,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7494c3d73/9f9565b1d6a4481b9d4359930aa3b220 [2024-11-17 00:42:21,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:42:21,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:42:21,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:42:21,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:42:21,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:42:21,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:21" (1/1) ... [2024-11-17 00:42:21,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2c4a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:21, skipping insertion in model container [2024-11-17 00:42:21,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:21" (1/1) ... [2024-11-17 00:42:21,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:42:21,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:42:21,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:42:22,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:42:22,038 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:42:22,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22 WrapperNode [2024-11-17 00:42:22,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:42:22,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:42:22,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:42:22,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:42:22,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,088 INFO L138 Inliner]: procedures = 119, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 213 [2024-11-17 00:42:22,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:42:22,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:42:22,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:42:22,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:42:22,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,140 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-17 00:42:22,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:42:22,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:42:22,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:42:22,166 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:42:22,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (1/1) ... [2024-11-17 00:42:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:42:22,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:22,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:42:22,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:42:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:42:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:42:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:42:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:42:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:42:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:42:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:42:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:42:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:42:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:42:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:42:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:42:22,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:42:22,396 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:42:22,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:42:22,950 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-17 00:42:22,950 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:42:22,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:42:22,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:42:22,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:42:22 BoogieIcfgContainer [2024-11-17 00:42:22,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:42:22,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:42:22,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:42:22,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:42:22,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:42:21" (1/3) ... [2024-11-17 00:42:22,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd7d309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:22, skipping insertion in model container [2024-11-17 00:42:22,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:22" (2/3) ... [2024-11-17 00:42:22,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd7d309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:22, skipping insertion in model container [2024-11-17 00:42:22,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:42:22" (3/3) ... [2024-11-17 00:42:22,991 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2024-11-17 00:42:23,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:42:23,011 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2024-11-17 00:42:23,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:42:23,079 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;@78c9baf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:42:23,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-11-17 00:42:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 134 states have (on average 1.8955223880597014) internal successors, (254), 200 states have internal predecessors, (254), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:42:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:42:23,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:23,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:42:23,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:23,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 297867, now seen corresponding path program 1 times [2024-11-17 00:42:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481331344] [2024-11-17 00:42:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:23,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481331344] [2024-11-17 00:42:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481331344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:42:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700460282] [2024-11-17 00:42:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:23,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:23,396 INFO L87 Difference]: Start difference. First operand has 215 states, 134 states have (on average 1.8955223880597014) internal successors, (254), 200 states have internal predecessors, (254), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:23,641 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2024-11-17 00:42:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-17 00:42:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:23,652 INFO L225 Difference]: With dead ends: 196 [2024-11-17 00:42:23,653 INFO L226 Difference]: Without dead ends: 193 [2024-11-17 00:42:23,655 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-11-17 00:42:23,660 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 172 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:23,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-17 00:42:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-17 00:42:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 122 states have (on average 1.6721311475409837) internal successors, (204), 191 states have internal predecessors, (204), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2024-11-17 00:42:23,703 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 3 [2024-11-17 00:42:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:23,703 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2024-11-17 00:42:23,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2024-11-17 00:42:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:42:23,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:23,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:42:23,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:42:23,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:23,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 297868, now seen corresponding path program 1 times [2024-11-17 00:42:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144928168] [2024-11-17 00:42:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144928168] [2024-11-17 00:42:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144928168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:42:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46613577] [2024-11-17 00:42:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:23,806 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:23,979 INFO L93 Difference]: Finished difference Result 217 states and 245 transitions. [2024-11-17 00:42:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-17 00:42:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:23,982 INFO L225 Difference]: With dead ends: 217 [2024-11-17 00:42:23,982 INFO L226 Difference]: Without dead ends: 217 [2024-11-17 00:42:23,982 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-11-17 00:42:23,983 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 169 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:23,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 174 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-17 00:42:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2024-11-17 00:42:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 205 states have internal predecessors, (229), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 242 transitions. [2024-11-17 00:42:24,008 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 242 transitions. Word has length 3 [2024-11-17 00:42:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:24,009 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 242 transitions. [2024-11-17 00:42:24,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2024-11-17 00:42:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:42:24,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:24,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:42:24,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1902458754, now seen corresponding path program 1 times [2024-11-17 00:42:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963252309] [2024-11-17 00:42:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963252309] [2024-11-17 00:42:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963252309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:24,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:24,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647864139] [2024-11-17 00:42:24,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:24,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:24,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:24,086 INFO L87 Difference]: Start difference. First operand 207 states and 242 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-17 00:42:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:24,135 INFO L93 Difference]: Finished difference Result 219 states and 246 transitions. [2024-11-17 00:42:24,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:24,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-17 00:42:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:24,137 INFO L225 Difference]: With dead ends: 219 [2024-11-17 00:42:24,139 INFO L226 Difference]: Without dead ends: 219 [2024-11-17 00:42:24,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:24,141 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 172 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:24,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 233 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-17 00:42:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 206. [2024-11-17 00:42:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 204 states have internal predecessors, (227), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2024-11-17 00:42:24,165 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 8 [2024-11-17 00:42:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:24,165 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2024-11-17 00:42:24,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-17 00:42:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2024-11-17 00:42:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:42:24,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:24,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:24,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:42:24,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:24,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 143254773, now seen corresponding path program 1 times [2024-11-17 00:42:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:24,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97039796] [2024-11-17 00:42:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:24,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97039796] [2024-11-17 00:42:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97039796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779146521] [2024-11-17 00:42:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:24,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:24,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:24,407 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:24,591 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2024-11-17 00:42:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:42:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:24,592 INFO L225 Difference]: With dead ends: 205 [2024-11-17 00:42:24,593 INFO L226 Difference]: Without dead ends: 205 [2024-11-17 00:42:24,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:24,594 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:24,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 596 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-17 00:42:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-17 00:42:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 143 states have (on average 1.5804195804195804) internal successors, (226), 203 states have internal predecessors, (226), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2024-11-17 00:42:24,606 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 12 [2024-11-17 00:42:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:24,606 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2024-11-17 00:42:24,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2024-11-17 00:42:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:42:24,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:24,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:42:24,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:24,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 143254774, now seen corresponding path program 1 times [2024-11-17 00:42:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780096039] [2024-11-17 00:42:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:24,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:24,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780096039] [2024-11-17 00:42:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780096039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001985523] [2024-11-17 00:42:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:24,836 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:25,009 INFO L93 Difference]: Finished difference Result 204 states and 237 transitions. [2024-11-17 00:42:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:42:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:25,010 INFO L225 Difference]: With dead ends: 204 [2024-11-17 00:42:25,010 INFO L226 Difference]: Without dead ends: 204 [2024-11-17 00:42:25,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:25,012 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:25,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 612 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-17 00:42:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-17 00:42:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.5734265734265733) internal successors, (225), 202 states have internal predecessors, (225), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2024-11-17 00:42:25,025 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 12 [2024-11-17 00:42:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:25,025 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2024-11-17 00:42:25,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2024-11-17 00:42:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:42:25,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:25,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:42:25,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1494336385, now seen corresponding path program 1 times [2024-11-17 00:42:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629664336] [2024-11-17 00:42:25,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629664336] [2024-11-17 00:42:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629664336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541345000] [2024-11-17 00:42:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:25,260 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:25,562 INFO L93 Difference]: Finished difference Result 203 states and 236 transitions. [2024-11-17 00:42:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:42:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:42:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:25,565 INFO L225 Difference]: With dead ends: 203 [2024-11-17 00:42:25,565 INFO L226 Difference]: Without dead ends: 203 [2024-11-17 00:42:25,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:42:25,570 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 169 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:25,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 485 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-17 00:42:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-17 00:42:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.5664335664335665) internal successors, (224), 201 states have internal predecessors, (224), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2024-11-17 00:42:25,582 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 15 [2024-11-17 00:42:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:25,582 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2024-11-17 00:42:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2024-11-17 00:42:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:42:25,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:25,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:42:25,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:25,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1494336384, now seen corresponding path program 1 times [2024-11-17 00:42:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194919472] [2024-11-17 00:42:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194919472] [2024-11-17 00:42:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194919472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163953094] [2024-11-17 00:42:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:25,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:25,953 INFO L87 Difference]: Start difference. First operand 203 states and 236 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:26,308 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2024-11-17 00:42:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:42:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 00:42:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:26,311 INFO L225 Difference]: With dead ends: 202 [2024-11-17 00:42:26,312 INFO L226 Difference]: Without dead ends: 202 [2024-11-17 00:42:26,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:42:26,312 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 166 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:26,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 578 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-17 00:42:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-17 00:42:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 200 states have internal predecessors, (223), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2024-11-17 00:42:26,320 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 15 [2024-11-17 00:42:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:26,320 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2024-11-17 00:42:26,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2024-11-17 00:42:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:42:26,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:26,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:26,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:42:26,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:26,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 577316104, now seen corresponding path program 1 times [2024-11-17 00:42:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:26,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983666562] [2024-11-17 00:42:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983666562] [2024-11-17 00:42:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983666562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:26,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665416983] [2024-11-17 00:42:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:26,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:26,349 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-11-17 00:42:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:26,362 INFO L93 Difference]: Finished difference Result 203 states and 236 transitions. [2024-11-17 00:42:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-11-17 00:42:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:26,364 INFO L225 Difference]: With dead ends: 203 [2024-11-17 00:42:26,364 INFO L226 Difference]: Without dead ends: 203 [2024-11-17 00:42:26,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:26,365 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:26,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-17 00:42:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-17 00:42:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 201 states have internal predecessors, (224), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2024-11-17 00:42:26,373 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 17 [2024-11-17 00:42:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:26,373 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2024-11-17 00:42:26,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-11-17 00:42:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2024-11-17 00:42:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:42:26,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:26,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:26,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:42:26,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:26,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1663638696, now seen corresponding path program 1 times [2024-11-17 00:42:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136627544] [2024-11-17 00:42:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136627544] [2024-11-17 00:42:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136627544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042145769] [2024-11-17 00:42:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:26,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:42:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:42:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:42:26,502 INFO L87 Difference]: Start difference. First operand 203 states and 236 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:26,687 INFO L93 Difference]: Finished difference Result 292 states and 339 transitions. [2024-11-17 00:42:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:26,687 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:42:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:26,689 INFO L225 Difference]: With dead ends: 292 [2024-11-17 00:42:26,689 INFO L226 Difference]: Without dead ends: 292 [2024-11-17 00:42:26,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:26,689 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 186 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:26,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 702 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-17 00:42:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 201. [2024-11-17 00:42:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 199 states have internal predecessors, (222), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-11-17 00:42:26,695 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 19 [2024-11-17 00:42:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:26,695 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-11-17 00:42:26,696 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-11-17 00:42:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:42:26,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:26,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:26,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:42:26,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 713115477, now seen corresponding path program 1 times [2024-11-17 00:42:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668766671] [2024-11-17 00:42:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668766671] [2024-11-17 00:42:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668766671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172329656] [2024-11-17 00:42:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:26,795 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:26,926 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2024-11-17 00:42:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:42:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:26,928 INFO L225 Difference]: With dead ends: 293 [2024-11-17 00:42:26,929 INFO L226 Difference]: Without dead ends: 293 [2024-11-17 00:42:26,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-17 00:42:26,929 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:26,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 664 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-17 00:42:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 205. [2024-11-17 00:42:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 203 states have internal predecessors, (226), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2024-11-17 00:42:26,935 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 19 [2024-11-17 00:42:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:26,935 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2024-11-17 00:42:26,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2024-11-17 00:42:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:42:26,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:26,936 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] [2024-11-17 00:42:26,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:42:26,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:26,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash 992073461, now seen corresponding path program 1 times [2024-11-17 00:42:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138316432] [2024-11-17 00:42:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138316432] [2024-11-17 00:42:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138316432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:27,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091499360] [2024-11-17 00:42:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:27,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:27,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:27,105 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:27,415 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2024-11-17 00:42:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:42:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:27,417 INFO L225 Difference]: With dead ends: 255 [2024-11-17 00:42:27,417 INFO L226 Difference]: Without dead ends: 255 [2024-11-17 00:42:27,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:42:27,418 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 424 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:27,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 302 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-17 00:42:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2024-11-17 00:42:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 232 states have internal predecessors, (269), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2024-11-17 00:42:27,425 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 21 [2024-11-17 00:42:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:27,427 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2024-11-17 00:42:27,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2024-11-17 00:42:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:42:27,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:27,428 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-11-17 00:42:27,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:42:27,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1998027540, now seen corresponding path program 1 times [2024-11-17 00:42:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169451004] [2024-11-17 00:42:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169451004] [2024-11-17 00:42:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169451004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806160279] [2024-11-17 00:42:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:42:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:42:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:42:27,475 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-17 00:42:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:27,587 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions. [2024-11-17 00:42:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:42:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 26 [2024-11-17 00:42:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:27,589 INFO L225 Difference]: With dead ends: 257 [2024-11-17 00:42:27,589 INFO L226 Difference]: Without dead ends: 257 [2024-11-17 00:42:27,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:27,589 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:27,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 330 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-17 00:42:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2024-11-17 00:42:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 231 states have internal predecessors, (267), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2024-11-17 00:42:27,598 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 26 [2024-11-17 00:42:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2024-11-17 00:42:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-17 00:42:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2024-11-17 00:42:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:42:27,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:27,599 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] [2024-11-17 00:42:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:42:27,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:27,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1744345874, now seen corresponding path program 1 times [2024-11-17 00:42:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616701898] [2024-11-17 00:42:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616701898] [2024-11-17 00:42:27,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616701898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:27,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:27,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695165757] [2024-11-17 00:42:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:27,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:27,706 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:27,935 INFO L93 Difference]: Finished difference Result 222 states and 264 transitions. [2024-11-17 00:42:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:42:27,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:42:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:27,937 INFO L225 Difference]: With dead ends: 222 [2024-11-17 00:42:27,937 INFO L226 Difference]: Without dead ends: 222 [2024-11-17 00:42:27,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:27,938 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 82 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:27,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 487 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-17 00:42:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2024-11-17 00:42:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.4375) internal successors, (253), 219 states have internal predecessors, (253), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2024-11-17 00:42:27,944 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 25 [2024-11-17 00:42:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:27,944 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2024-11-17 00:42:27,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2024-11-17 00:42:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:42:27,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:27,947 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] [2024-11-17 00:42:27,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:42:27,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1744345873, now seen corresponding path program 1 times [2024-11-17 00:42:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929035911] [2024-11-17 00:42:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929035911] [2024-11-17 00:42:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929035911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322306675] [2024-11-17 00:42:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:28,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:28,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:28,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:28,138 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:28,347 INFO L93 Difference]: Finished difference Result 213 states and 255 transitions. [2024-11-17 00:42:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:42:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:28,348 INFO L225 Difference]: With dead ends: 213 [2024-11-17 00:42:28,348 INFO L226 Difference]: Without dead ends: 213 [2024-11-17 00:42:28,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:28,349 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 38 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:28,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 579 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-17 00:42:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2024-11-17 00:42:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 171 states have (on average 1.391812865497076) internal successors, (238), 205 states have internal predecessors, (238), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2024-11-17 00:42:28,354 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 25 [2024-11-17 00:42:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2024-11-17 00:42:28,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2024-11-17 00:42:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:42:28,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:28,355 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, 1] [2024-11-17 00:42:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:42:28,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1735778697, now seen corresponding path program 1 times [2024-11-17 00:42:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318981699] [2024-11-17 00:42:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318981699] [2024-11-17 00:42:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318981699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:42:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2918839] [2024-11-17 00:42:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:28,443 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-11-17 00:42:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:28,558 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2024-11-17 00:42:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:28,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 30 [2024-11-17 00:42:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:28,560 INFO L225 Difference]: With dead ends: 211 [2024-11-17 00:42:28,560 INFO L226 Difference]: Without dead ends: 211 [2024-11-17 00:42:28,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-17 00:42:28,561 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 36 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:28,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 693 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-17 00:42:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2024-11-17 00:42:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.3801169590643274) internal successors, (236), 203 states have internal predecessors, (236), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2024-11-17 00:42:28,565 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 30 [2024-11-17 00:42:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:28,566 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2024-11-17 00:42:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-11-17 00:42:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2024-11-17 00:42:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:42:28,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:28,567 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, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:28,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:42:28,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -229949176, now seen corresponding path program 1 times [2024-11-17 00:42:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018423381] [2024-11-17 00:42:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018423381] [2024-11-17 00:42:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018423381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450423367] [2024-11-17 00:42:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:28,601 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-17 00:42:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:28,611 INFO L93 Difference]: Finished difference Result 221 states and 262 transitions. [2024-11-17 00:42:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:28,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2024-11-17 00:42:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:28,613 INFO L225 Difference]: With dead ends: 221 [2024-11-17 00:42:28,613 INFO L226 Difference]: Without dead ends: 221 [2024-11-17 00:42:28,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:28,613 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:28,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-17 00:42:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-17 00:42:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.3701657458563536) internal successors, (248), 213 states have internal predecessors, (248), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 256 transitions. [2024-11-17 00:42:28,618 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 256 transitions. Word has length 35 [2024-11-17 00:42:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 256 transitions. [2024-11-17 00:42:28,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-17 00:42:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 256 transitions. [2024-11-17 00:42:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:42:28,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:28,620 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:42:28,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:28,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -886762280, now seen corresponding path program 1 times [2024-11-17 00:42:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:28,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756010278] [2024-11-17 00:42:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756010278] [2024-11-17 00:42:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756010278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710144074] [2024-11-17 00:42:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:28,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:28,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:28,657 INFO L87 Difference]: Start difference. First operand 215 states and 256 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-11-17 00:42:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:28,678 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2024-11-17 00:42:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 36 [2024-11-17 00:42:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:28,680 INFO L225 Difference]: With dead ends: 214 [2024-11-17 00:42:28,680 INFO L226 Difference]: Without dead ends: 214 [2024-11-17 00:42:28,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:28,681 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 13 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:28,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 294 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-17 00:42:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-17 00:42:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.3591160220994476) internal successors, (246), 212 states have internal predecessors, (246), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2024-11-17 00:42:28,686 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 36 [2024-11-17 00:42:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:28,686 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2024-11-17 00:42:28,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-11-17 00:42:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2024-11-17 00:42:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 00:42:28,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:28,687 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:42:28,687 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -886899322, now seen corresponding path program 1 times [2024-11-17 00:42:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348935711] [2024-11-17 00:42:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:28,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348935711] [2024-11-17 00:42:28,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348935711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:28,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:28,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:42:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963309815] [2024-11-17 00:42:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:28,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:42:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:42:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:42:28,892 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:29,237 INFO L93 Difference]: Finished difference Result 344 states and 394 transitions. [2024-11-17 00:42:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-17 00:42:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:29,238 INFO L225 Difference]: With dead ends: 344 [2024-11-17 00:42:29,238 INFO L226 Difference]: Without dead ends: 344 [2024-11-17 00:42:29,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:42:29,239 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 369 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:29,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 877 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-17 00:42:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 253. [2024-11-17 00:42:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 251 states have internal predecessors, (290), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 297 transitions. [2024-11-17 00:42:29,244 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 297 transitions. Word has length 36 [2024-11-17 00:42:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:29,245 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 297 transitions. [2024-11-17 00:42:29,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2024-11-17 00:42:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:42:29,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:29,246 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:29,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:42:29,246 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:29,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -23371999, now seen corresponding path program 1 times [2024-11-17 00:42:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351054104] [2024-11-17 00:42:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351054104] [2024-11-17 00:42:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351054104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549671971] [2024-11-17 00:42:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:29,353 INFO L87 Difference]: Start difference. First operand 253 states and 297 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:29,482 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2024-11-17 00:42:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:29,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 00:42:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:29,484 INFO L225 Difference]: With dead ends: 252 [2024-11-17 00:42:29,484 INFO L226 Difference]: Without dead ends: 252 [2024-11-17 00:42:29,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:29,485 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:29,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-17 00:42:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-17 00:42:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 250 states have internal predecessors, (289), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2024-11-17 00:42:29,490 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 37 [2024-11-17 00:42:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:29,491 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2024-11-17 00:42:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2024-11-17 00:42:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:42:29,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:29,492 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:42:29,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -23371998, now seen corresponding path program 1 times [2024-11-17 00:42:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261365982] [2024-11-17 00:42:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:29,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261365982] [2024-11-17 00:42:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261365982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:29,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:29,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:29,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042959017] [2024-11-17 00:42:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:29,677 INFO L87 Difference]: Start difference. First operand 252 states and 296 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:29,820 INFO L93 Difference]: Finished difference Result 251 states and 295 transitions. [2024-11-17 00:42:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 00:42:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:29,821 INFO L225 Difference]: With dead ends: 251 [2024-11-17 00:42:29,822 INFO L226 Difference]: Without dead ends: 251 [2024-11-17 00:42:29,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:29,822 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:29,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-17 00:42:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-17 00:42:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 220 states have (on average 1.309090909090909) internal successors, (288), 249 states have internal predecessors, (288), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 295 transitions. [2024-11-17 00:42:29,828 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 295 transitions. Word has length 37 [2024-11-17 00:42:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:29,829 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 295 transitions. [2024-11-17 00:42:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 295 transitions. [2024-11-17 00:42:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:42:29,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:29,830 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:42:29,831 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash -565540319, now seen corresponding path program 1 times [2024-11-17 00:42:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287421352] [2024-11-17 00:42:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:29,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287421352] [2024-11-17 00:42:29,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287421352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:29,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65762588] [2024-11-17 00:42:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:29,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:29,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:30,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:30,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:42:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:30,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:42:30,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:30,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:30,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:30,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:42:30,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:42:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:30,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:30,974 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 10 treesize of output 8 [2024-11-17 00:42:30,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-17 00:42:30,990 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 10 treesize of output 8 [2024-11-17 00:42:30,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65762588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:31,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-11-17 00:42:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133612853] [2024-11-17 00:42:31,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:31,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:42:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:42:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:42:31,015 INFO L87 Difference]: Start difference. First operand 251 states and 295 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:31,423 INFO L93 Difference]: Finished difference Result 350 states and 400 transitions. [2024-11-17 00:42:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2024-11-17 00:42:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:31,425 INFO L225 Difference]: With dead ends: 350 [2024-11-17 00:42:31,426 INFO L226 Difference]: Without dead ends: 350 [2024-11-17 00:42:31,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:42:31,427 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 455 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:31,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 857 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-17 00:42:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 299. [2024-11-17 00:42:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 268 states have (on average 1.3022388059701493) internal successors, (349), 297 states have internal predecessors, (349), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 356 transitions. [2024-11-17 00:42:31,434 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 356 transitions. Word has length 38 [2024-11-17 00:42:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:31,434 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 356 transitions. [2024-11-17 00:42:31,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 356 transitions. [2024-11-17 00:42:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:42:31,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:31,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:31,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:42:31,639 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,SelfDestructingSolverStorable20 [2024-11-17 00:42:31,640 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -490382329, now seen corresponding path program 1 times [2024-11-17 00:42:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709859915] [2024-11-17 00:42:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709859915] [2024-11-17 00:42:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709859915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:42:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399072140] [2024-11-17 00:42:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:42:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:42:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:42:31,959 INFO L87 Difference]: Start difference. First operand 299 states and 356 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:32,429 INFO L93 Difference]: Finished difference Result 299 states and 356 transitions. [2024-11-17 00:42:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:42:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-17 00:42:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:32,432 INFO L225 Difference]: With dead ends: 299 [2024-11-17 00:42:32,432 INFO L226 Difference]: Without dead ends: 299 [2024-11-17 00:42:32,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:42:32,433 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 71 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:32,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 929 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:42:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-17 00:42:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2024-11-17 00:42:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 268 states have (on average 1.2985074626865671) internal successors, (348), 296 states have internal predecessors, (348), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 355 transitions. [2024-11-17 00:42:32,440 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 355 transitions. Word has length 40 [2024-11-17 00:42:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:32,440 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 355 transitions. [2024-11-17 00:42:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 355 transitions. [2024-11-17 00:42:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:42:32,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:32,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:42:32,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:32,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash -490382328, now seen corresponding path program 1 times [2024-11-17 00:42:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:32,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939663026] [2024-11-17 00:42:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:32,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939663026] [2024-11-17 00:42:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939663026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:42:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989133332] [2024-11-17 00:42:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:32,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:42:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:42:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:42:32,856 INFO L87 Difference]: Start difference. First operand 298 states and 355 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:33,307 INFO L93 Difference]: Finished difference Result 298 states and 355 transitions. [2024-11-17 00:42:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:42:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-17 00:42:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:33,309 INFO L225 Difference]: With dead ends: 298 [2024-11-17 00:42:33,309 INFO L226 Difference]: Without dead ends: 298 [2024-11-17 00:42:33,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:42:33,310 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 69 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:33,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 955 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:42:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-17 00:42:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2024-11-17 00:42:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 268 states have (on average 1.294776119402985) internal successors, (347), 295 states have internal predecessors, (347), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 354 transitions. [2024-11-17 00:42:33,317 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 354 transitions. Word has length 40 [2024-11-17 00:42:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:33,317 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 354 transitions. [2024-11-17 00:42:33,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 354 transitions. [2024-11-17 00:42:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:42:33,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:33,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:33,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:42:33,318 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:33,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:33,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1581711099, now seen corresponding path program 1 times [2024-11-17 00:42:33,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:33,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818768089] [2024-11-17 00:42:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:33,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:33,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:33,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818768089] [2024-11-17 00:42:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818768089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:33,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:42:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120502217] [2024-11-17 00:42:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:33,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:42:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:42:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:42:33,591 INFO L87 Difference]: Start difference. First operand 297 states and 354 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:34,185 INFO L93 Difference]: Finished difference Result 368 states and 423 transitions. [2024-11-17 00:42:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:42:34,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-17 00:42:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:34,186 INFO L225 Difference]: With dead ends: 368 [2024-11-17 00:42:34,186 INFO L226 Difference]: Without dead ends: 368 [2024-11-17 00:42:34,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:42:34,187 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 315 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:34,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1029 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:42:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-17 00:42:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 300. [2024-11-17 00:42:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 273 states have (on average 1.271062271062271) internal successors, (347), 298 states have internal predecessors, (347), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 354 transitions. [2024-11-17 00:42:34,193 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 354 transitions. Word has length 41 [2024-11-17 00:42:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 354 transitions. [2024-11-17 00:42:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 354 transitions. [2024-11-17 00:42:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:42:34,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:34,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 00:42:34,195 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1581711100, now seen corresponding path program 1 times [2024-11-17 00:42:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298587907] [2024-11-17 00:42:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298587907] [2024-11-17 00:42:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298587907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:42:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111323634] [2024-11-17 00:42:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:42:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:42:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:42:34,644 INFO L87 Difference]: Start difference. First operand 300 states and 354 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:35,370 INFO L93 Difference]: Finished difference Result 378 states and 435 transitions. [2024-11-17 00:42:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:42:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-17 00:42:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:35,373 INFO L225 Difference]: With dead ends: 378 [2024-11-17 00:42:35,373 INFO L226 Difference]: Without dead ends: 378 [2024-11-17 00:42:35,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:42:35,374 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 333 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:35,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1112 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:42:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-17 00:42:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 307. [2024-11-17 00:42:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 305 states have internal predecessors, (355), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 362 transitions. [2024-11-17 00:42:35,384 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 362 transitions. Word has length 41 [2024-11-17 00:42:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:35,384 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 362 transitions. [2024-11-17 00:42:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 362 transitions. [2024-11-17 00:42:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:42:35,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:35,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:35,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:42:35,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:35,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -990410410, now seen corresponding path program 1 times [2024-11-17 00:42:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275307828] [2024-11-17 00:42:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275307828] [2024-11-17 00:42:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275307828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:35,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180131964] [2024-11-17 00:42:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:35,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:35,434 INFO L87 Difference]: Start difference. First operand 307 states and 362 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-17 00:42:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:35,443 INFO L93 Difference]: Finished difference Result 309 states and 364 transitions. [2024-11-17 00:42:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 42 [2024-11-17 00:42:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:35,446 INFO L225 Difference]: With dead ends: 309 [2024-11-17 00:42:35,446 INFO L226 Difference]: Without dead ends: 309 [2024-11-17 00:42:35,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:35,447 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:35,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-17 00:42:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-17 00:42:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 282 states have (on average 1.2659574468085106) internal successors, (357), 307 states have internal predecessors, (357), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 364 transitions. [2024-11-17 00:42:35,455 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 364 transitions. Word has length 42 [2024-11-17 00:42:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 364 transitions. [2024-11-17 00:42:35,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-17 00:42:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 364 transitions. [2024-11-17 00:42:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:42:35,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:35,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:42:35,460 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1749904010, now seen corresponding path program 1 times [2024-11-17 00:42:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522728393] [2024-11-17 00:42:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522728393] [2024-11-17 00:42:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522728393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15002040] [2024-11-17 00:42:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:42:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:42:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:42:35,592 INFO L87 Difference]: Start difference. First operand 309 states and 364 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-11-17 00:42:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:35,762 INFO L93 Difference]: Finished difference Result 320 states and 375 transitions. [2024-11-17 00:42:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:35,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 44 [2024-11-17 00:42:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:35,764 INFO L225 Difference]: With dead ends: 320 [2024-11-17 00:42:35,764 INFO L226 Difference]: Without dead ends: 320 [2024-11-17 00:42:35,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:35,765 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 20 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:35,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 666 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-17 00:42:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 306. [2024-11-17 00:42:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 280 states have (on average 1.2607142857142857) internal successors, (353), 304 states have internal predecessors, (353), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 359 transitions. [2024-11-17 00:42:35,772 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 359 transitions. Word has length 44 [2024-11-17 00:42:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:35,772 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 359 transitions. [2024-11-17 00:42:35,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-11-17 00:42:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 359 transitions. [2024-11-17 00:42:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:42:35,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:35,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:35,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 00:42:35,773 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:35,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash -728987122, now seen corresponding path program 1 times [2024-11-17 00:42:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480095294] [2024-11-17 00:42:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480095294] [2024-11-17 00:42:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480095294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 00:42:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678746979] [2024-11-17 00:42:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:42:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:42:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:42:36,375 INFO L87 Difference]: Start difference. First operand 306 states and 359 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-11-17 00:42:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:37,158 INFO L93 Difference]: Finished difference Result 389 states and 437 transitions. [2024-11-17 00:42:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:42:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 45 [2024-11-17 00:42:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:37,160 INFO L225 Difference]: With dead ends: 389 [2024-11-17 00:42:37,160 INFO L226 Difference]: Without dead ends: 389 [2024-11-17 00:42:37,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:42:37,161 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 583 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:37,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1197 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:42:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-17 00:42:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 306. [2024-11-17 00:42:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 280 states have (on average 1.2571428571428571) internal successors, (352), 304 states have internal predecessors, (352), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2024-11-17 00:42:37,167 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 45 [2024-11-17 00:42:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2024-11-17 00:42:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-11-17 00:42:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2024-11-17 00:42:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:42:37,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:37,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:37,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-17 00:42:37,169 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1954936495, now seen corresponding path program 1 times [2024-11-17 00:42:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927485066] [2024-11-17 00:42:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927485066] [2024-11-17 00:42:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927485066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026913011] [2024-11-17 00:42:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:42:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:42:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:42:37,275 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-11-17 00:42:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:37,460 INFO L93 Difference]: Finished difference Result 321 states and 373 transitions. [2024-11-17 00:42:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 47 [2024-11-17 00:42:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:37,462 INFO L225 Difference]: With dead ends: 321 [2024-11-17 00:42:37,462 INFO L226 Difference]: Without dead ends: 321 [2024-11-17 00:42:37,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:37,464 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:37,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 609 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-17 00:42:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-11-17 00:42:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 292 states have (on average 1.2465753424657535) internal successors, (364), 316 states have internal predecessors, (364), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 370 transitions. [2024-11-17 00:42:37,472 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 370 transitions. Word has length 47 [2024-11-17 00:42:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:37,472 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 370 transitions. [2024-11-17 00:42:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-11-17 00:42:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 370 transitions. [2024-11-17 00:42:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:42:37,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:37,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 00:42:37,473 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:37,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1599757660, now seen corresponding path program 1 times [2024-11-17 00:42:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051846047] [2024-11-17 00:42:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051846047] [2024-11-17 00:42:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051846047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:42:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589943117] [2024-11-17 00:42:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:37,512 INFO L87 Difference]: Start difference. First operand 318 states and 370 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:37,560 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2024-11-17 00:42:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-17 00:42:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:37,562 INFO L225 Difference]: With dead ends: 327 [2024-11-17 00:42:37,562 INFO L226 Difference]: Without dead ends: 327 [2024-11-17 00:42:37,562 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-11-17 00:42:37,563 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 95 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:37,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 169 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-17 00:42:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2024-11-17 00:42:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 293 states have (on average 1.2457337883959045) internal successors, (365), 317 states have internal predecessors, (365), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 371 transitions. [2024-11-17 00:42:37,569 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 371 transitions. Word has length 46 [2024-11-17 00:42:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:37,569 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 371 transitions. [2024-11-17 00:42:37,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 371 transitions. [2024-11-17 00:42:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:42:37,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:37,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:37,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 00:42:37,570 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -520042737, now seen corresponding path program 1 times [2024-11-17 00:42:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056496177] [2024-11-17 00:42:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056496177] [2024-11-17 00:42:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056496177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 00:42:38,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093774724] [2024-11-17 00:42:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:38,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:42:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:42:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:42:38,242 INFO L87 Difference]: Start difference. First operand 319 states and 371 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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-11-17 00:42:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:38,941 INFO L93 Difference]: Finished difference Result 398 states and 445 transitions. [2024-11-17 00:42:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:42:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 49 [2024-11-17 00:42:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:38,943 INFO L225 Difference]: With dead ends: 398 [2024-11-17 00:42:38,943 INFO L226 Difference]: Without dead ends: 398 [2024-11-17 00:42:38,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:42:38,944 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 342 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:38,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1266 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:42:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-17 00:42:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 319. [2024-11-17 00:42:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 293 states have (on average 1.242320819112628) internal successors, (364), 317 states have internal predecessors, (364), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 370 transitions. [2024-11-17 00:42:38,950 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 370 transitions. Word has length 49 [2024-11-17 00:42:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 370 transitions. [2024-11-17 00:42:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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-11-17 00:42:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 370 transitions. [2024-11-17 00:42:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:42:38,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:38,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:38,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 00:42:38,953 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:38,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2025318938, now seen corresponding path program 1 times [2024-11-17 00:42:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24325811] [2024-11-17 00:42:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:38,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24325811] [2024-11-17 00:42:38,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24325811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:38,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:38,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566481855] [2024-11-17 00:42:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:38,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:38,994 INFO L87 Difference]: Start difference. First operand 319 states and 370 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-17 00:42:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:39,049 INFO L93 Difference]: Finished difference Result 321 states and 370 transitions. [2024-11-17 00:42:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 52 [2024-11-17 00:42:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:39,051 INFO L225 Difference]: With dead ends: 321 [2024-11-17 00:42:39,051 INFO L226 Difference]: Without dead ends: 321 [2024-11-17 00:42:39,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:39,053 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 77 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:39,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 193 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-17 00:42:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-11-17 00:42:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 293 states have (on average 1.235494880546075) internal successors, (362), 316 states have internal predecessors, (362), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 367 transitions. [2024-11-17 00:42:39,060 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 367 transitions. Word has length 52 [2024-11-17 00:42:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:39,061 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 367 transitions. [2024-11-17 00:42:39,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-17 00:42:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 367 transitions. [2024-11-17 00:42:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:42:39,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:39,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:39,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-17 00:42:39,062 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:39,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2040223457, now seen corresponding path program 1 times [2024-11-17 00:42:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606510284] [2024-11-17 00:42:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606510284] [2024-11-17 00:42:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606510284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431988700] [2024-11-17 00:42:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:39,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:39,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:39,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:42:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:39,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 00:42:39,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:39,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:39,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:39,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:42:39,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:42:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:39,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431988700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:39,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2024-11-17 00:42:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206565360] [2024-11-17 00:42:39,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:42:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:42:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:42:39,743 INFO L87 Difference]: Start difference. First operand 318 states and 367 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,082 INFO L93 Difference]: Finished difference Result 406 states and 461 transitions. [2024-11-17 00:42:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:42:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-17 00:42:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,084 INFO L225 Difference]: With dead ends: 406 [2024-11-17 00:42:40,084 INFO L226 Difference]: Without dead ends: 406 [2024-11-17 00:42:40,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:42:40,085 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 137 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 979 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-17 00:42:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 350. [2024-11-17 00:42:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 325 states have (on average 1.243076923076923) internal successors, (404), 348 states have internal predecessors, (404), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 409 transitions. [2024-11-17 00:42:40,092 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 409 transitions. Word has length 51 [2024-11-17 00:42:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,092 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 409 transitions. [2024-11-17 00:42:40,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 409 transitions. [2024-11-17 00:42:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:42:40,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:40,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:42:40,294 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,SelfDestructingSolverStorable32 [2024-11-17 00:42:40,295 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:40,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2025133977, now seen corresponding path program 1 times [2024-11-17 00:42:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11644997] [2024-11-17 00:42:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11644997] [2024-11-17 00:42:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11644997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:42:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135280854] [2024-11-17 00:42:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:42:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:42:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:40,649 INFO L87 Difference]: Start difference. First operand 350 states and 409 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:41,078 INFO L93 Difference]: Finished difference Result 416 states and 476 transitions. [2024-11-17 00:42:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:42:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:41,080 INFO L225 Difference]: With dead ends: 416 [2024-11-17 00:42:41,080 INFO L226 Difference]: Without dead ends: 416 [2024-11-17 00:42:41,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:42:41,081 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 260 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:41,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 786 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-17 00:42:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 367. [2024-11-17 00:42:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 342 states have (on average 1.2426900584795322) internal successors, (425), 365 states have internal predecessors, (425), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 430 transitions. [2024-11-17 00:42:41,088 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 430 transitions. Word has length 52 [2024-11-17 00:42:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 430 transitions. [2024-11-17 00:42:41,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 430 transitions. [2024-11-17 00:42:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:42:41,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:41,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:41,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 00:42:41,090 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2025133976, now seen corresponding path program 1 times [2024-11-17 00:42:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876184459] [2024-11-17 00:42:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876184459] [2024-11-17 00:42:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876184459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:42:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547027464] [2024-11-17 00:42:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:41,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:42:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:42:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:41,306 INFO L87 Difference]: Start difference. First operand 367 states and 430 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:41,672 INFO L93 Difference]: Finished difference Result 414 states and 473 transitions. [2024-11-17 00:42:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:42:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:41,673 INFO L225 Difference]: With dead ends: 414 [2024-11-17 00:42:41,673 INFO L226 Difference]: Without dead ends: 414 [2024-11-17 00:42:41,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:42:41,674 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 363 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:41,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 707 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:42:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-17 00:42:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 367. [2024-11-17 00:42:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 342 states have (on average 1.239766081871345) internal successors, (424), 365 states have internal predecessors, (424), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 429 transitions. [2024-11-17 00:42:41,681 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 429 transitions. Word has length 52 [2024-11-17 00:42:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:41,682 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 429 transitions. [2024-11-17 00:42:41,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 429 transitions. [2024-11-17 00:42:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:42:41,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:41,683 INFO L215 NwaCegarLoop]: trace histogram [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, 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-11-17 00:42:41,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-17 00:42:41,683 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:41,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2145230665, now seen corresponding path program 1 times [2024-11-17 00:42:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520744091] [2024-11-17 00:42:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:41,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520744091] [2024-11-17 00:42:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520744091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366509900] [2024-11-17 00:42:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:41,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:41,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:42:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:42:41,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:41,944 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 13 treesize of output 9 [2024-11-17 00:42:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:41,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:42:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366509900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:42,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:42,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-17 00:42:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475649144] [2024-11-17 00:42:42,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:42,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:42,058 INFO L87 Difference]: Start difference. First operand 367 states and 429 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:42,202 INFO L93 Difference]: Finished difference Result 407 states and 469 transitions. [2024-11-17 00:42:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:42:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-17 00:42:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:42,204 INFO L225 Difference]: With dead ends: 407 [2024-11-17 00:42:42,204 INFO L226 Difference]: Without dead ends: 374 [2024-11-17 00:42:42,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:42,204 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:42,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-17 00:42:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 00:42:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 349 states have (on average 1.2349570200573066) internal successors, (431), 372 states have internal predecessors, (431), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 436 transitions. [2024-11-17 00:42:42,215 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 436 transitions. Word has length 53 [2024-11-17 00:42:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 436 transitions. [2024-11-17 00:42:42,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 436 transitions. [2024-11-17 00:42:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:42:42,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:42,216 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, 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-11-17 00:42:42,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:42:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:42,418 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1656322395, now seen corresponding path program 1 times [2024-11-17 00:42:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:42,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726887422] [2024-11-17 00:42:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726887422] [2024-11-17 00:42:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726887422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:42:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27000574] [2024-11-17 00:42:42,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:42,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:42,711 INFO L87 Difference]: Start difference. First operand 374 states and 436 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-11-17 00:42:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:42,977 INFO L93 Difference]: Finished difference Result 394 states and 452 transitions. [2024-11-17 00:42:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:42,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 56 [2024-11-17 00:42:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:42,978 INFO L225 Difference]: With dead ends: 394 [2024-11-17 00:42:42,979 INFO L226 Difference]: Without dead ends: 394 [2024-11-17 00:42:42,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:42,979 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 173 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:42,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 550 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-17 00:42:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 372. [2024-11-17 00:42:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 347 states have (on average 1.2334293948126802) internal successors, (428), 370 states have internal predecessors, (428), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 433 transitions. [2024-11-17 00:42:42,986 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 433 transitions. Word has length 56 [2024-11-17 00:42:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:42,986 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 433 transitions. [2024-11-17 00:42:42,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-11-17 00:42:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 433 transitions. [2024-11-17 00:42:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:42:42,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:42,987 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, 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-11-17 00:42:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-17 00:42:42,988 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:42,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 984590956, now seen corresponding path program 1 times [2024-11-17 00:42:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877071185] [2024-11-17 00:42:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877071185] [2024-11-17 00:42:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877071185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:43,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475986718] [2024-11-17 00:42:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:43,025 INFO L87 Difference]: Start difference. First operand 372 states and 433 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-17 00:42:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:43,037 INFO L93 Difference]: Finished difference Result 442 states and 520 transitions. [2024-11-17 00:42:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 56 [2024-11-17 00:42:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:43,039 INFO L225 Difference]: With dead ends: 442 [2024-11-17 00:42:43,039 INFO L226 Difference]: Without dead ends: 442 [2024-11-17 00:42:43,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:43,040 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 11 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:43,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 322 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-17 00:42:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 422. [2024-11-17 00:42:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 397 states have (on average 1.256926952141058) internal successors, (499), 420 states have internal predecessors, (499), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 504 transitions. [2024-11-17 00:42:43,047 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 504 transitions. Word has length 56 [2024-11-17 00:42:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 504 transitions. [2024-11-17 00:42:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-17 00:42:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 504 transitions. [2024-11-17 00:42:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:42:43,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:43,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:43,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-17 00:42:43,049 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1862231743, now seen corresponding path program 1 times [2024-11-17 00:42:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:43,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554630168] [2024-11-17 00:42:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:43,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:43,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554630168] [2024-11-17 00:42:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554630168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:42:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572014377] [2024-11-17 00:42:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:43,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:43,140 INFO L87 Difference]: Start difference. First operand 422 states and 504 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:43,221 INFO L93 Difference]: Finished difference Result 352 states and 398 transitions. [2024-11-17 00:42:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:42:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-17 00:42:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:43,223 INFO L225 Difference]: With dead ends: 352 [2024-11-17 00:42:43,224 INFO L226 Difference]: Without dead ends: 352 [2024-11-17 00:42:43,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:43,226 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:43,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 647 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-17 00:42:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2024-11-17 00:42:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 326 states have (on average 1.2024539877300613) internal successors, (392), 348 states have internal predecessors, (392), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 396 transitions. [2024-11-17 00:42:43,233 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 396 transitions. Word has length 57 [2024-11-17 00:42:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:43,233 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 396 transitions. [2024-11-17 00:42:43,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 396 transitions. [2024-11-17 00:42:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:42:43,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:43,234 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2024-11-17 00:42:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-17 00:42:43,235 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash -197419180, now seen corresponding path program 1 times [2024-11-17 00:42:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335957751] [2024-11-17 00:42:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:42:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335957751] [2024-11-17 00:42:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335957751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:42:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769461268] [2024-11-17 00:42:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:42:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:42:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:43,480 INFO L87 Difference]: Start difference. First operand 350 states and 396 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:43,778 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2024-11-17 00:42:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:43,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-17 00:42:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:43,780 INFO L225 Difference]: With dead ends: 332 [2024-11-17 00:42:43,780 INFO L226 Difference]: Without dead ends: 332 [2024-11-17 00:42:43,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:42:43,781 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 255 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:43,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 708 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-17 00:42:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2024-11-17 00:42:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 297 states have (on average 1.2154882154882154) internal successors, (361), 319 states have internal predecessors, (361), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 365 transitions. [2024-11-17 00:42:43,787 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 365 transitions. Word has length 60 [2024-11-17 00:42:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 365 transitions. [2024-11-17 00:42:43,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 365 transitions. [2024-11-17 00:42:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:42:43,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:43,788 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, 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, 1] [2024-11-17 00:42:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-17 00:42:43,788 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1446791560, now seen corresponding path program 1 times [2024-11-17 00:42:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582266529] [2024-11-17 00:42:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:42:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582266529] [2024-11-17 00:42:43,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582266529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945366910] [2024-11-17 00:42:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:43,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:43,919 INFO L87 Difference]: Start difference. First operand 321 states and 365 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:44,023 INFO L93 Difference]: Finished difference Result 335 states and 379 transitions. [2024-11-17 00:42:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:44,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-17 00:42:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:44,024 INFO L225 Difference]: With dead ends: 335 [2024-11-17 00:42:44,024 INFO L226 Difference]: Without dead ends: 335 [2024-11-17 00:42:44,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-17 00:42:44,025 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 11 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:44,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 552 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-17 00:42:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 325. [2024-11-17 00:42:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 301 states have (on average 1.2093023255813953) internal successors, (364), 323 states have internal predecessors, (364), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 368 transitions. [2024-11-17 00:42:44,030 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 368 transitions. Word has length 60 [2024-11-17 00:42:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:44,030 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 368 transitions. [2024-11-17 00:42:44,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 368 transitions. [2024-11-17 00:42:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:42:44,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:44,031 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, 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, 1, 1, 1] [2024-11-17 00:42:44,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-17 00:42:44,032 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:44,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1038578264, now seen corresponding path program 1 times [2024-11-17 00:42:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994548919] [2024-11-17 00:42:44,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994548919] [2024-11-17 00:42:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994548919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447105683] [2024-11-17 00:42:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:44,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:44,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:42:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:44,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:42:44,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:44,557 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:42:44,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:42:44,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:44,725 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-17 00:42:44,837 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:44,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-17 00:42:45,054 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 25 treesize of output 13 [2024-11-17 00:42:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:45,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:45,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:45,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-17 00:42:45,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:45,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-17 00:42:45,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-17 00:42:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447105683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:46,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-11-17 00:42:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031324102] [2024-11-17 00:42:46,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:46,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-17 00:42:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 00:42:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=734, Unknown=8, NotChecked=0, Total=870 [2024-11-17 00:42:46,528 INFO L87 Difference]: Start difference. First operand 325 states and 368 transitions. Second operand has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 30 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:47,871 INFO L93 Difference]: Finished difference Result 559 states and 620 transitions. [2024-11-17 00:42:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:42:47,872 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 30 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-17 00:42:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:47,874 INFO L225 Difference]: With dead ends: 559 [2024-11-17 00:42:47,874 INFO L226 Difference]: Without dead ends: 559 [2024-11-17 00:42:47,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1052, Unknown=8, NotChecked=0, Total=1260 [2024-11-17 00:42:47,875 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 772 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:47,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 2130 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 00:42:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-17 00:42:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 383. [2024-11-17 00:42:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 359 states have (on average 1.2061281337047354) internal successors, (433), 381 states have internal predecessors, (433), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 437 transitions. [2024-11-17 00:42:47,881 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 437 transitions. Word has length 62 [2024-11-17 00:42:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:47,882 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 437 transitions. [2024-11-17 00:42:47,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 30 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 437 transitions. [2024-11-17 00:42:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:42:47,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:47,883 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, 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, 1, 1, 1] [2024-11-17 00:42:47,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:42:48,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:48,084 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1038578263, now seen corresponding path program 1 times [2024-11-17 00:42:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225123462] [2024-11-17 00:42:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:48,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225123462] [2024-11-17 00:42:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225123462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531073467] [2024-11-17 00:42:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:48,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:48,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:48,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:42:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:48,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-17 00:42:48,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:48,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:48,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:42:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:42:48,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:42:48,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:48,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:42:48,897 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:42:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:42:48,913 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:48,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-17 00:42:49,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:49,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-17 00:42:49,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-17 00:42:49,300 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 25 treesize of output 13 [2024-11-17 00:42:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:42:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:49,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:49,824 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|) 5))))) is different from false [2024-11-17 00:42:49,995 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1126) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0)))) is different from false [2024-11-17 00:42:50,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1126) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1125 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1125) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))))))) is different from false [2024-11-17 00:42:50,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:50,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-17 00:42:50,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:50,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-17 00:42:50,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:50,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-11-17 00:42:50,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:50,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2024-11-17 00:42:50,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-17 00:42:50,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-17 00:42:50,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:50,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-17 00:42:50,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:42:50,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:50,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 00:42:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531073467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:50,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-11-17 00:42:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078425734] [2024-11-17 00:42:50,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:50,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-17 00:42:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 00:42:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=728, Unknown=3, NotChecked=168, Total=992 [2024-11-17 00:42:50,476 INFO L87 Difference]: Start difference. First operand 383 states and 437 transitions. Second operand has 32 states, 31 states have (on average 5.935483870967742) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:51,964 INFO L93 Difference]: Finished difference Result 535 states and 595 transitions. [2024-11-17 00:42:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:42:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.935483870967742) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-17 00:42:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:51,967 INFO L225 Difference]: With dead ends: 535 [2024-11-17 00:42:51,967 INFO L226 Difference]: Without dead ends: 535 [2024-11-17 00:42:51,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1613, Unknown=3, NotChecked=258, Total=2162 [2024-11-17 00:42:51,969 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1388 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1184 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:51,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 1808 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1665 Invalid, 0 Unknown, 1184 Unchecked, 1.0s Time] [2024-11-17 00:42:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-17 00:42:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 406. [2024-11-17 00:42:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 382 states have (on average 1.2094240837696335) internal successors, (462), 404 states have internal predecessors, (462), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 466 transitions. [2024-11-17 00:42:51,980 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 466 transitions. Word has length 62 [2024-11-17 00:42:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:51,981 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 466 transitions. [2024-11-17 00:42:51,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.935483870967742) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 466 transitions. [2024-11-17 00:42:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:42:51,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:51,982 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:52,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:42:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:52,187 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2024-11-17 00:42:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 22964546, now seen corresponding path program 1 times [2024-11-17 00:42:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164140674] [2024-11-17 00:42:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164140674] [2024-11-17 00:42:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164140674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92169276] [2024-11-17 00:42:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:52,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:52,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:52,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:52,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:42:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:53,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 00:42:53,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:53,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:53,060 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:42:53,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:42:53,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:53,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:53,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-17 00:42:53,194 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:53,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-17 00:42:53,322 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-17 00:42:53,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-17 00:42:53,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-17 00:42:53,602 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:53,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2024-11-17 00:42:53,773 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:53,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-17 00:42:54,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:42:54,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2024-11-17 00:42:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:54,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:54,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2024-11-17 00:42:54,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2024-11-17 00:42:58,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2024-11-17 00:42:58,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_88| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_88| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_88|))) is different from false [2024-11-17 00:42:58,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1232 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_88| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1227))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_88| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_88|))) is different from false [2024-11-17 00:43:22,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:22,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:22,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2024-11-17 00:43:22,719 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 194 treesize of output 182 [2024-11-17 00:43:22,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:22,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2024-11-17 00:43:22,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:22,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-17 00:43:22,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:22,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-11-17 00:43:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92169276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:43:39,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:43:39,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2024-11-17 00:43:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268518751] [2024-11-17 00:43:39,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:43:39,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 00:43:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 00:43:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1170, Unknown=31, NotChecked=380, Total=1806 [2024-11-17 00:43:39,095 INFO L87 Difference]: Start difference. First operand 406 states and 466 transitions. Second operand has 43 states, 42 states have (on average 3.857142857142857) internal successors, (162), 43 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)