./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:40:14,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:40:14,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:40:14,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:40:14,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:40:14,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:40:14,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:40:14,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:40:14,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:40:14,154 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:40:14,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:40:14,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:40:14,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:40:14,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:40:14,158 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:40:14,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:40:14,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:40:14,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:40:14,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:40:14,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:40:14,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:40:14,164 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:40:14,164 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:40:14,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:40:14,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:40:14,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:40:14,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:40:14,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:40:14,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:40:14,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:40:14,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:40:14,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:40:14,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:40:14,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:40:14,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:40:14,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:40:14,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:40:14,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:40:14,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:40:14,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:40:14,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:40:14,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:40:14,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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2024-10-13 10:40:14,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:40:14,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:40:14,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:40:14,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:40:14,479 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:40:14,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-10-13 10:40:15,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:40:16,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:40:16,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-10-13 10:40:16,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389b08e27/ea973b77fefd4e5eb71ecedadce82569/FLAG5f13950b0 [2024-10-13 10:40:16,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389b08e27/ea973b77fefd4e5eb71ecedadce82569 [2024-10-13 10:40:16,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:40:16,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:40:16,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:40:16,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:40:16,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:40:16,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:16" (1/1) ... [2024-10-13 10:40:16,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf3ab8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:16, skipping insertion in model container [2024-10-13 10:40:16,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:16" (1/1) ... [2024-10-13 10:40:16,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:40:16,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:40:16,955 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:40:17,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:40:17,094 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:40:17,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17 WrapperNode [2024-10-13 10:40:17,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:40:17,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:40:17,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:40:17,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:40:17,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,162 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-10-13 10:40:17,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:40:17,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:40:17,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:40:17,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:40:17,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,215 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 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-10-13 10:40:17,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:40:17,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:40:17,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:40:17,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:40:17,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (1/1) ... [2024-10-13 10:40:17,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:40:17,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:17,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:40:17,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:40:17,335 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-13 10:40:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-13 10:40:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:40:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:40:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:40:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:40:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:40:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:40:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:40:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:40:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:40:17,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:40:17,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:40:17,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:40:17,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:40:17,498 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:40:17,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:40:18,069 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-13 10:40:18,069 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:40:18,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:40:18,136 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 10:40:18,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:18 BoogieIcfgContainer [2024-10-13 10:40:18,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:40:18,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:40:18,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:40:18,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:40:18,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:40:16" (1/3) ... [2024-10-13 10:40:18,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2c9dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:18, skipping insertion in model container [2024-10-13 10:40:18,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:17" (2/3) ... [2024-10-13 10:40:18,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2c9dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:18, skipping insertion in model container [2024-10-13 10:40:18,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:18" (3/3) ... [2024-10-13 10:40:18,146 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2024-10-13 10:40:18,165 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:40:18,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-13 10:40:18,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:40:18,227 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;@749bd980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:40:18,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-13 10:40:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 76 states have (on average 2.1842105263157894) internal successors, (166), 141 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:40:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:40:18,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:18,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:40:18,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 319878969, now seen corresponding path program 1 times [2024-10-13 10:40:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262256691] [2024-10-13 10:40:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:18,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:18,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262256691] [2024-10-13 10:40:18,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262256691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:40:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010098729] [2024-10-13 10:40:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:40:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:40:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:40:18,443 INFO L87 Difference]: Start difference. First operand has 145 states, 76 states have (on average 2.1842105263157894) internal successors, (166), 141 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:18,506 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2024-10-13 10:40:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:40:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:40:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:18,515 INFO L225 Difference]: With dead ends: 145 [2024-10-13 10:40:18,516 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 10:40:18,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:40:18,521 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:18,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:40:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 10:40:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-13 10:40:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 140 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:40:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-10-13 10:40:18,561 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 5 [2024-10-13 10:40:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:18,561 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-10-13 10:40:18,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-10-13 10:40:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:40:18,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:18,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:40:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:40:18,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:18,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452205, now seen corresponding path program 1 times [2024-10-13 10:40:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995676716] [2024-10-13 10:40:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995676716] [2024-10-13 10:40:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995676716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:40:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967271823] [2024-10-13 10:40:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:40:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:40:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:18,745 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:18,960 INFO L93 Difference]: Finished difference Result 281 states and 318 transitions. [2024-10-13 10:40:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:40:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:40:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:18,963 INFO L225 Difference]: With dead ends: 281 [2024-10-13 10:40:18,966 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 10:40:18,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:18,967 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 146 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:18,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 194 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 10:40:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 195. [2024-10-13 10:40:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 124 states have (on average 2.064516129032258) internal successors, (256), 188 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:40:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-13 10:40:18,991 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 6 [2024-10-13 10:40:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:18,992 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-13 10:40:18,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-13 10:40:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:40:18,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:18,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:40:18,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:40:18,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:18,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452206, now seen corresponding path program 1 times [2024-10-13 10:40:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061148476] [2024-10-13 10:40:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:19,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061148476] [2024-10-13 10:40:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061148476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:19,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:19,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:40:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904306282] [2024-10-13 10:40:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:19,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:19,188 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:19,345 INFO L93 Difference]: Finished difference Result 198 states and 267 transitions. [2024-10-13 10:40:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:40:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:19,348 INFO L225 Difference]: With dead ends: 198 [2024-10-13 10:40:19,348 INFO L226 Difference]: Without dead ends: 198 [2024-10-13 10:40:19,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:19,349 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 160 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:19,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 203 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-13 10:40:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-10-13 10:40:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 126 states have (on average 2.0555555555555554) internal successors, (259), 190 states have internal predecessors, (259), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:40:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 267 transitions. [2024-10-13 10:40:19,371 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 267 transitions. Word has length 6 [2024-10-13 10:40:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 267 transitions. [2024-10-13 10:40:19,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 267 transitions. [2024-10-13 10:40:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:40:19,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:19,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:40:19,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:40:19,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:19,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452268, now seen corresponding path program 1 times [2024-10-13 10:40:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403865361] [2024-10-13 10:40:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403865361] [2024-10-13 10:40:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403865361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:40:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503895690] [2024-10-13 10:40:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:19,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:19,480 INFO L87 Difference]: Start difference. First operand 197 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:19,605 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-10-13 10:40:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:40:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:19,607 INFO L225 Difference]: With dead ends: 197 [2024-10-13 10:40:19,607 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 10:40:19,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:19,609 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 157 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:19,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 203 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 10:40:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-10-13 10:40:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 124 states have (on average 2.0483870967741935) internal successors, (254), 187 states have internal predecessors, (254), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:40:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2024-10-13 10:40:19,619 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 6 [2024-10-13 10:40:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2024-10-13 10:40:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2024-10-13 10:40:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:40:19,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:19,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:19,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:40:19,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:19,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 11661335, now seen corresponding path program 1 times [2024-10-13 10:40:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423111167] [2024-10-13 10:40:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423111167] [2024-10-13 10:40:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423111167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458951085] [2024-10-13 10:40:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:19,818 INFO L87 Difference]: Start difference. First operand 194 states and 262 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:20,016 INFO L93 Difference]: Finished difference Result 343 states and 455 transitions. [2024-10-13 10:40:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:20,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:40:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:20,020 INFO L225 Difference]: With dead ends: 343 [2024-10-13 10:40:20,021 INFO L226 Difference]: Without dead ends: 343 [2024-10-13 10:40:20,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:20,023 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 118 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:20,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 480 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-13 10:40:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 252. [2024-10-13 10:40:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 176 states have (on average 1.9602272727272727) internal successors, (345), 241 states have internal predecessors, (345), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-10-13 10:40:20,042 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 8 [2024-10-13 10:40:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:20,043 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-10-13 10:40:20,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-10-13 10:40:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:40:20,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:20,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:20,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:40:20,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:20,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 11720917, now seen corresponding path program 1 times [2024-10-13 10:40:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:20,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041848212] [2024-10-13 10:40:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:20,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041848212] [2024-10-13 10:40:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041848212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99260127] [2024-10-13 10:40:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:20,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:20,160 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:20,334 INFO L93 Difference]: Finished difference Result 334 states and 445 transitions. [2024-10-13 10:40:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:40:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:20,338 INFO L225 Difference]: With dead ends: 334 [2024-10-13 10:40:20,338 INFO L226 Difference]: Without dead ends: 334 [2024-10-13 10:40:20,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:20,339 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 105 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:20,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 513 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-13 10:40:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 252. [2024-10-13 10:40:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 176 states have (on average 1.9602272727272727) internal successors, (345), 241 states have internal predecessors, (345), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-10-13 10:40:20,359 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 8 [2024-10-13 10:40:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-10-13 10:40:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-10-13 10:40:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:40:20,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:20,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:40:20,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 361500123, now seen corresponding path program 1 times [2024-10-13 10:40:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881543088] [2024-10-13 10:40:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881543088] [2024-10-13 10:40:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881543088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:40:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722036407] [2024-10-13 10:40:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:40:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:40:20,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:20,392 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:20,510 INFO L93 Difference]: Finished difference Result 300 states and 405 transitions. [2024-10-13 10:40:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:40:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:40:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:20,514 INFO L225 Difference]: With dead ends: 300 [2024-10-13 10:40:20,514 INFO L226 Difference]: Without dead ends: 294 [2024-10-13 10:40:20,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:20,517 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:20,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 219 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-13 10:40:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 249. [2024-10-13 10:40:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 173 states have (on average 1.9653179190751444) internal successors, (340), 238 states have internal predecessors, (340), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2024-10-13 10:40:20,530 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 9 [2024-10-13 10:40:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:20,531 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2024-10-13 10:40:20,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:40:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2024-10-13 10:40:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:40:20,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:20,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:20,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:40:20,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1143205964, now seen corresponding path program 1 times [2024-10-13 10:40:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274239238] [2024-10-13 10:40:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:40:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274239238] [2024-10-13 10:40:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274239238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155084915] [2024-10-13 10:40:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:20,606 INFO L87 Difference]: Start difference. First operand 249 states and 356 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:20,818 INFO L93 Difference]: Finished difference Result 341 states and 427 transitions. [2024-10-13 10:40:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 10:40:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:20,820 INFO L225 Difference]: With dead ends: 341 [2024-10-13 10:40:20,820 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 10:40:20,821 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-10-13 10:40:20,822 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 146 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:20,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 280 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 10:40:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 255. [2024-10-13 10:40:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 179 states have (on average 1.9329608938547487) internal successors, (346), 244 states have internal predecessors, (346), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 362 transitions. [2024-10-13 10:40:20,833 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 362 transitions. Word has length 14 [2024-10-13 10:40:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:20,834 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 362 transitions. [2024-10-13 10:40:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 362 transitions. [2024-10-13 10:40:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:40:20,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:20,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:40:20,837 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1143205965, now seen corresponding path program 1 times [2024-10-13 10:40:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556434978] [2024-10-13 10:40:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:40:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:20,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556434978] [2024-10-13 10:40:20,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556434978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:20,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:20,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044695333] [2024-10-13 10:40:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:20,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:20,952 INFO L87 Difference]: Start difference. First operand 255 states and 362 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:21,079 INFO L93 Difference]: Finished difference Result 254 states and 352 transitions. [2024-10-13 10:40:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 10:40:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:21,081 INFO L225 Difference]: With dead ends: 254 [2024-10-13 10:40:21,081 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 10:40:21,081 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-10-13 10:40:21,082 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 155 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:21,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 192 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 10:40:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-10-13 10:40:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 179 states have (on average 1.8659217877094971) internal successors, (334), 241 states have internal predecessors, (334), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 350 transitions. [2024-10-13 10:40:21,113 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 350 transitions. Word has length 14 [2024-10-13 10:40:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 350 transitions. [2024-10-13 10:40:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 350 transitions. [2024-10-13 10:40:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:40:21,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:21,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:21,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:40:21,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 427633431, now seen corresponding path program 1 times [2024-10-13 10:40:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798910007] [2024-10-13 10:40:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798910007] [2024-10-13 10:40:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798910007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874775323] [2024-10-13 10:40:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:21,273 INFO L87 Difference]: Start difference. First operand 252 states and 350 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:21,543 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2024-10-13 10:40:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:21,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-13 10:40:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:21,545 INFO L225 Difference]: With dead ends: 349 [2024-10-13 10:40:21,545 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 10:40:21,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:21,546 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 262 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:21,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 326 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 10:40:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 249. [2024-10-13 10:40:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 180 states have (on average 1.8222222222222222) internal successors, (328), 238 states have internal predecessors, (328), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:40:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 344 transitions. [2024-10-13 10:40:21,558 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 344 transitions. Word has length 16 [2024-10-13 10:40:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:21,558 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 344 transitions. [2024-10-13 10:40:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 344 transitions. [2024-10-13 10:40:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:40:21,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:21,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:40:21,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 427633432, now seen corresponding path program 1 times [2024-10-13 10:40:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151536606] [2024-10-13 10:40:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151536606] [2024-10-13 10:40:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151536606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:40:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263602157] [2024-10-13 10:40:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:21,718 INFO L87 Difference]: Start difference. First operand 249 states and 344 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:21,921 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2024-10-13 10:40:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-13 10:40:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:21,924 INFO L225 Difference]: With dead ends: 311 [2024-10-13 10:40:21,924 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 10:40:21,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:40:21,925 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 220 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:21,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 389 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 10:40:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2024-10-13 10:40:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 228 states have (on average 1.8026315789473684) internal successors, (411), 288 states have internal predecessors, (411), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 10:40:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 435 transitions. [2024-10-13 10:40:21,939 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 435 transitions. Word has length 16 [2024-10-13 10:40:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:21,940 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 435 transitions. [2024-10-13 10:40:21,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 435 transitions. [2024-10-13 10:40:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:40:21,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:21,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:21,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:40:21,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:21,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1379821031, now seen corresponding path program 1 times [2024-10-13 10:40:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590951618] [2024-10-13 10:40:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:22,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:22,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590951618] [2024-10-13 10:40:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590951618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:22,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:40:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405449190] [2024-10-13 10:40:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:22,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:22,032 INFO L87 Difference]: Start difference. First operand 301 states and 435 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:22,119 INFO L93 Difference]: Finished difference Result 301 states and 433 transitions. [2024-10-13 10:40:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-13 10:40:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:22,122 INFO L225 Difference]: With dead ends: 301 [2024-10-13 10:40:22,123 INFO L226 Difference]: Without dead ends: 301 [2024-10-13 10:40:22,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:22,124 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:22,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 699 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-13 10:40:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-13 10:40:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 228 states have (on average 1.793859649122807) internal successors, (409), 288 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 10:40:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 433 transitions. [2024-10-13 10:40:22,135 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 433 transitions. Word has length 16 [2024-10-13 10:40:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:22,135 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 433 transitions. [2024-10-13 10:40:22,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 433 transitions. [2024-10-13 10:40:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:40:22,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:22,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:22,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:40:22,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:22,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash 175276576, now seen corresponding path program 1 times [2024-10-13 10:40:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072287773] [2024-10-13 10:40:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072287773] [2024-10-13 10:40:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072287773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:40:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103207317] [2024-10-13 10:40:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:22,322 INFO L87 Difference]: Start difference. First operand 301 states and 433 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:22,558 INFO L93 Difference]: Finished difference Result 342 states and 494 transitions. [2024-10-13 10:40:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:22,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-13 10:40:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:22,561 INFO L225 Difference]: With dead ends: 342 [2024-10-13 10:40:22,561 INFO L226 Difference]: Without dead ends: 342 [2024-10-13 10:40:22,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:40:22,562 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 179 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:22,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 462 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-13 10:40:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 296. [2024-10-13 10:40:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 223 states have (on average 1.798206278026906) internal successors, (401), 283 states have internal predecessors, (401), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 10:40:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 425 transitions. [2024-10-13 10:40:22,578 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 425 transitions. Word has length 17 [2024-10-13 10:40:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:22,578 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 425 transitions. [2024-10-13 10:40:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 425 transitions. [2024-10-13 10:40:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:40:22,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:22,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:40:22,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1129705676, now seen corresponding path program 1 times [2024-10-13 10:40:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3793016] [2024-10-13 10:40:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:40:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:22,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3793016] [2024-10-13 10:40:22,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3793016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:22,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:22,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:40:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217369371] [2024-10-13 10:40:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:22,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:22,756 INFO L87 Difference]: Start difference. First operand 296 states and 425 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:22,999 INFO L93 Difference]: Finished difference Result 388 states and 531 transitions. [2024-10-13 10:40:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-13 10:40:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:23,001 INFO L225 Difference]: With dead ends: 388 [2024-10-13 10:40:23,002 INFO L226 Difference]: Without dead ends: 388 [2024-10-13 10:40:23,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:23,003 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 91 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:23,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 630 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-13 10:40:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 290. [2024-10-13 10:40:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 217 states have (on average 1.7972350230414746) internal successors, (390), 277 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 10:40:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-10-13 10:40:23,017 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 18 [2024-10-13 10:40:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:23,017 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-10-13 10:40:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-10-13 10:40:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:40:23,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:23,018 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-10-13 10:40:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:40:23,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:23,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -660774663, now seen corresponding path program 1 times [2024-10-13 10:40:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240504970] [2024-10-13 10:40:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:40:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,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-10-13 10:40:23,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240504970] [2024-10-13 10:40:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240504970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:23,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360470222] [2024-10-13 10:40:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:23,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:23,077 INFO L87 Difference]: Start difference. First operand 290 states and 414 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:23,224 INFO L93 Difference]: Finished difference Result 289 states and 411 transitions. [2024-10-13 10:40:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:23,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 10:40:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:23,227 INFO L225 Difference]: With dead ends: 289 [2024-10-13 10:40:23,227 INFO L226 Difference]: Without dead ends: 289 [2024-10-13 10:40:23,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:23,229 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:23,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 378 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-13 10:40:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-13 10:40:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 217 states have (on average 1.7557603686635945) internal successors, (381), 271 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-13 10:40:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 405 transitions. [2024-10-13 10:40:23,237 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 405 transitions. Word has length 19 [2024-10-13 10:40:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:23,237 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 405 transitions. [2024-10-13 10:40:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 405 transitions. [2024-10-13 10:40:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:40:23,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:23,238 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-10-13 10:40:23,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:40:23,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:23,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -660774662, now seen corresponding path program 1 times [2024-10-13 10:40:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154466153] [2024-10-13 10:40:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:40:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154466153] [2024-10-13 10:40:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154466153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:23,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713281752] [2024-10-13 10:40:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:23,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:23,385 INFO L87 Difference]: Start difference. First operand 284 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:23,536 INFO L93 Difference]: Finished difference Result 288 states and 400 transitions. [2024-10-13 10:40:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 10:40:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:23,538 INFO L225 Difference]: With dead ends: 288 [2024-10-13 10:40:23,540 INFO L226 Difference]: Without dead ends: 288 [2024-10-13 10:40:23,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:23,541 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 49 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:23,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 603 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-13 10:40:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 249. [2024-10-13 10:40:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 186 states have (on average 1.7795698924731183) internal successors, (331), 238 states have internal predecessors, (331), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 349 transitions. [2024-10-13 10:40:23,548 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 349 transitions. Word has length 19 [2024-10-13 10:40:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:23,549 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 349 transitions. [2024-10-13 10:40:23,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 349 transitions. [2024-10-13 10:40:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:40:23,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:23,550 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-10-13 10:40:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:40:23,550 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 762169515, now seen corresponding path program 1 times [2024-10-13 10:40:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617893031] [2024-10-13 10:40:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617893031] [2024-10-13 10:40:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617893031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323208151] [2024-10-13 10:40:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:23,732 INFO L87 Difference]: Start difference. First operand 249 states and 349 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:23,929 INFO L93 Difference]: Finished difference Result 300 states and 415 transitions. [2024-10-13 10:40:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:40:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 10:40:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:23,931 INFO L225 Difference]: With dead ends: 300 [2024-10-13 10:40:23,931 INFO L226 Difference]: Without dead ends: 300 [2024-10-13 10:40:23,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:23,932 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 81 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:23,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 707 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-13 10:40:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2024-10-13 10:40:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 194 states have (on average 1.7577319587628866) internal successors, (341), 245 states have internal predecessors, (341), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 359 transitions. [2024-10-13 10:40:23,940 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 359 transitions. Word has length 19 [2024-10-13 10:40:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 359 transitions. [2024-10-13 10:40:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 359 transitions. [2024-10-13 10:40:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:40:23,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:23,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:23,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:40:23,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1008159581, now seen corresponding path program 1 times [2024-10-13 10:40:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032375342] [2024-10-13 10:40:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032375342] [2024-10-13 10:40:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032375342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769846944] [2024-10-13 10:40:24,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:24,138 INFO L87 Difference]: Start difference. First operand 257 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:24,352 INFO L93 Difference]: Finished difference Result 303 states and 415 transitions. [2024-10-13 10:40:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:40:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 10:40:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:24,355 INFO L225 Difference]: With dead ends: 303 [2024-10-13 10:40:24,355 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 10:40:24,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:40:24,355 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:24,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 697 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 10:40:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2024-10-13 10:40:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 198 states have (on average 1.7424242424242424) internal successors, (345), 248 states have internal predecessors, (345), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 363 transitions. [2024-10-13 10:40:24,366 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 363 transitions. Word has length 20 [2024-10-13 10:40:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:24,366 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 363 transitions. [2024-10-13 10:40:24,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 363 transitions. [2024-10-13 10:40:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:40:24,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:24,367 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] [2024-10-13 10:40:24,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:40:24,368 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1432820251, now seen corresponding path program 1 times [2024-10-13 10:40:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766077325] [2024-10-13 10:40:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766077325] [2024-10-13 10:40:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766077325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291519156] [2024-10-13 10:40:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:24,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:24,410 INFO L87 Difference]: Start difference. First operand 261 states and 363 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:24,462 INFO L93 Difference]: Finished difference Result 273 states and 375 transitions. [2024-10-13 10:40:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-13 10:40:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:24,464 INFO L225 Difference]: With dead ends: 273 [2024-10-13 10:40:24,464 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 10:40:24,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:24,465 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:24,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:40:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 10:40:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-13 10:40:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 210 states have (on average 1.7) internal successors, (357), 260 states have internal predecessors, (357), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 375 transitions. [2024-10-13 10:40:24,473 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 375 transitions. Word has length 22 [2024-10-13 10:40:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:24,473 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 375 transitions. [2024-10-13 10:40:24,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 375 transitions. [2024-10-13 10:40:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:40:24,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:24,474 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] [2024-10-13 10:40:24,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:40:24,475 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1432760669, now seen corresponding path program 1 times [2024-10-13 10:40:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233541676] [2024-10-13 10:40:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:24,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233541676] [2024-10-13 10:40:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233541676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203598001] [2024-10-13 10:40:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:24,556 INFO L87 Difference]: Start difference. First operand 273 states and 375 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:24,648 INFO L93 Difference]: Finished difference Result 336 states and 467 transitions. [2024-10-13 10:40:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:24,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-13 10:40:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:24,650 INFO L225 Difference]: With dead ends: 336 [2024-10-13 10:40:24,651 INFO L226 Difference]: Without dead ends: 336 [2024-10-13 10:40:24,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:24,652 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:24,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 207 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-13 10:40:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 330. [2024-10-13 10:40:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 267 states have (on average 1.6816479400749065) internal successors, (449), 317 states have internal predecessors, (449), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 467 transitions. [2024-10-13 10:40:24,661 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 467 transitions. Word has length 22 [2024-10-13 10:40:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:24,662 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 467 transitions. [2024-10-13 10:40:24,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 467 transitions. [2024-10-13 10:40:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:40:24,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:24,663 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] [2024-10-13 10:40:24,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:40:24,663 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1432760670, now seen corresponding path program 1 times [2024-10-13 10:40:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130582143] [2024-10-13 10:40:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130582143] [2024-10-13 10:40:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130582143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:40:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272400084] [2024-10-13 10:40:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:24,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:40:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:40:24,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:24,697 INFO L87 Difference]: Start difference. First operand 330 states and 467 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:24,769 INFO L93 Difference]: Finished difference Result 328 states and 455 transitions. [2024-10-13 10:40:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:40:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-13 10:40:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:24,771 INFO L225 Difference]: With dead ends: 328 [2024-10-13 10:40:24,771 INFO L226 Difference]: Without dead ends: 328 [2024-10-13 10:40:24,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:40:24,772 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:24,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 186 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-13 10:40:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-13 10:40:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 267 states have (on average 1.6367041198501873) internal successors, (437), 315 states have internal predecessors, (437), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 455 transitions. [2024-10-13 10:40:24,780 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 455 transitions. Word has length 22 [2024-10-13 10:40:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 455 transitions. [2024-10-13 10:40:24,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 455 transitions. [2024-10-13 10:40:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:40:24,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:24,781 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] [2024-10-13 10:40:24,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:40:24,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:24,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1402069452, now seen corresponding path program 1 times [2024-10-13 10:40:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871547064] [2024-10-13 10:40:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:24,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871547064] [2024-10-13 10:40:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871547064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:40:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170972433] [2024-10-13 10:40:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:24,850 INFO L87 Difference]: Start difference. First operand 328 states and 455 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:24,939 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-10-13 10:40:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-13 10:40:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:24,943 INFO L225 Difference]: With dead ends: 365 [2024-10-13 10:40:24,943 INFO L226 Difference]: Without dead ends: 365 [2024-10-13 10:40:24,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:24,944 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 36 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:24,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 633 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-13 10:40:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 328. [2024-10-13 10:40:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 267 states have (on average 1.6254681647940075) internal successors, (434), 315 states have internal predecessors, (434), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 452 transitions. [2024-10-13 10:40:24,953 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 452 transitions. Word has length 23 [2024-10-13 10:40:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 452 transitions. [2024-10-13 10:40:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2024-10-13 10:40:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:40:24,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:24,955 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] [2024-10-13 10:40:24,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:40:24,955 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:24,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash 891535275, now seen corresponding path program 1 times [2024-10-13 10:40:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659784760] [2024-10-13 10:40:24,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659784760] [2024-10-13 10:40:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659784760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271744888] [2024-10-13 10:40:25,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:25,020 INFO L87 Difference]: Start difference. First operand 328 states and 452 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:25,131 INFO L93 Difference]: Finished difference Result 391 states and 540 transitions. [2024-10-13 10:40:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-13 10:40:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:25,133 INFO L225 Difference]: With dead ends: 391 [2024-10-13 10:40:25,133 INFO L226 Difference]: Without dead ends: 391 [2024-10-13 10:40:25,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:25,134 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 217 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-13 10:40:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 328. [2024-10-13 10:40:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 267 states have (on average 1.6254681647940075) internal successors, (434), 315 states have internal predecessors, (434), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 452 transitions. [2024-10-13 10:40:25,142 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 452 transitions. Word has length 23 [2024-10-13 10:40:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:25,143 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 452 transitions. [2024-10-13 10:40:25,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2024-10-13 10:40:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:40:25,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:25,144 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] [2024-10-13 10:40:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:40:25,144 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:25,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1571593645, now seen corresponding path program 1 times [2024-10-13 10:40:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163142015] [2024-10-13 10:40:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163142015] [2024-10-13 10:40:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163142015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:40:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551077932] [2024-10-13 10:40:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:25,202 INFO L87 Difference]: Start difference. First operand 328 states and 452 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:25,265 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2024-10-13 10:40:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-13 10:40:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:25,267 INFO L225 Difference]: With dead ends: 270 [2024-10-13 10:40:25,267 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 10:40:25,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-13 10:40:25,268 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:25,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 10:40:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-13 10:40:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 210 states have (on average 1.6142857142857143) internal successors, (339), 257 states have internal predecessors, (339), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2024-10-13 10:40:25,274 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 23 [2024-10-13 10:40:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:25,274 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2024-10-13 10:40:25,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2024-10-13 10:40:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:40:25,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:25,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:25,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:40:25,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1801500355, now seen corresponding path program 1 times [2024-10-13 10:40:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:25,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225198903] [2024-10-13 10:40:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225198903] [2024-10-13 10:40:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225198903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:40:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282130039] [2024-10-13 10:40:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:25,343 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:25,435 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2024-10-13 10:40:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:40:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 10:40:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:25,438 INFO L225 Difference]: With dead ends: 300 [2024-10-13 10:40:25,438 INFO L226 Difference]: Without dead ends: 300 [2024-10-13 10:40:25,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:25,438 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:25,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-13 10:40:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-13 10:40:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 234 states have (on average 1.5769230769230769) internal successors, (369), 281 states have internal predecessors, (369), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 387 transitions. [2024-10-13 10:40:25,445 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 387 transitions. Word has length 24 [2024-10-13 10:40:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:25,445 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 387 transitions. [2024-10-13 10:40:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 387 transitions. [2024-10-13 10:40:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:40:25,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:25,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:40:25,447 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1801500549, now seen corresponding path program 1 times [2024-10-13 10:40:25,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:25,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132954] [2024-10-13 10:40:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132954] [2024-10-13 10:40:25,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:25,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467134108] [2024-10-13 10:40:25,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:25,520 INFO L87 Difference]: Start difference. First operand 294 states and 387 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:25,623 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2024-10-13 10:40:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-13 10:40:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:25,627 INFO L225 Difference]: With dead ends: 408 [2024-10-13 10:40:25,627 INFO L226 Difference]: Without dead ends: 408 [2024-10-13 10:40:25,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:25,628 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 71 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:25,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 327 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-13 10:40:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 383. [2024-10-13 10:40:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 370 states have internal predecessors, (503), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 521 transitions. [2024-10-13 10:40:25,638 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 521 transitions. Word has length 24 [2024-10-13 10:40:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:25,639 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 521 transitions. [2024-10-13 10:40:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 521 transitions. [2024-10-13 10:40:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:40:25,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:25,640 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-10-13 10:40:25,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:40:25,640 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2066908813, now seen corresponding path program 1 times [2024-10-13 10:40:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321849337] [2024-10-13 10:40:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321849337] [2024-10-13 10:40:25,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321849337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503468539] [2024-10-13 10:40:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:25,723 INFO L87 Difference]: Start difference. First operand 383 states and 521 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:25,840 INFO L93 Difference]: Finished difference Result 408 states and 543 transitions. [2024-10-13 10:40:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-13 10:40:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:25,843 INFO L225 Difference]: With dead ends: 408 [2024-10-13 10:40:25,843 INFO L226 Difference]: Without dead ends: 408 [2024-10-13 10:40:25,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:25,844 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 55 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:25,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 293 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-13 10:40:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 293. [2024-10-13 10:40:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.5427350427350428) internal successors, (361), 280 states have internal predecessors, (361), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 379 transitions. [2024-10-13 10:40:25,852 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 379 transitions. Word has length 25 [2024-10-13 10:40:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 379 transitions. [2024-10-13 10:40:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 379 transitions. [2024-10-13 10:40:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:40:25,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:25,853 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] [2024-10-13 10:40:25,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:40:25,853 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1402781752, now seen corresponding path program 1 times [2024-10-13 10:40:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741168483] [2024-10-13 10:40:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741168483] [2024-10-13 10:40:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741168483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:25,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:25,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402257534] [2024-10-13 10:40:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:25,947 INFO L87 Difference]: Start difference. First operand 293 states and 379 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:26,060 INFO L93 Difference]: Finished difference Result 294 states and 379 transitions. [2024-10-13 10:40:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-13 10:40:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:26,062 INFO L225 Difference]: With dead ends: 294 [2024-10-13 10:40:26,062 INFO L226 Difference]: Without dead ends: 294 [2024-10-13 10:40:26,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:26,063 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 37 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 261 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-10-13 10:40:26,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 261 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-13 10:40:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2024-10-13 10:40:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 234 states have (on average 1.5341880341880343) internal successors, (359), 279 states have internal predecessors, (359), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 377 transitions. [2024-10-13 10:40:26,069 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 377 transitions. Word has length 27 [2024-10-13 10:40:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:26,070 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 377 transitions. [2024-10-13 10:40:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 377 transitions. [2024-10-13 10:40:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:40:26,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:26,071 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] [2024-10-13 10:40:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:40:26,071 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1402781753, now seen corresponding path program 1 times [2024-10-13 10:40:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065474863] [2024-10-13 10:40:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065474863] [2024-10-13 10:40:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065474863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:40:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985240952] [2024-10-13 10:40:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:40:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:40:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:26,119 INFO L87 Difference]: Start difference. First operand 292 states and 377 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:26,210 INFO L93 Difference]: Finished difference Result 293 states and 377 transitions. [2024-10-13 10:40:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:40:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-13 10:40:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:26,211 INFO L225 Difference]: With dead ends: 293 [2024-10-13 10:40:26,211 INFO L226 Difference]: Without dead ends: 293 [2024-10-13 10:40:26,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:40:26,212 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:26,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-13 10:40:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-10-13 10:40:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 278 states have internal predecessors, (357), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 375 transitions. [2024-10-13 10:40:26,219 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 375 transitions. Word has length 27 [2024-10-13 10:40:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:26,219 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 375 transitions. [2024-10-13 10:40:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 375 transitions. [2024-10-13 10:40:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:40:26,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:26,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 10:40:26,220 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:26,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash 546469544, now seen corresponding path program 1 times [2024-10-13 10:40:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768629407] [2024-10-13 10:40:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768629407] [2024-10-13 10:40:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768629407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475588804] [2024-10-13 10:40:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:26,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:26,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:26,292 INFO L87 Difference]: Start difference. First operand 291 states and 375 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:26,419 INFO L93 Difference]: Finished difference Result 297 states and 371 transitions. [2024-10-13 10:40:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-13 10:40:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:26,420 INFO L225 Difference]: With dead ends: 297 [2024-10-13 10:40:26,420 INFO L226 Difference]: Without dead ends: 297 [2024-10-13 10:40:26,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:26,421 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:26,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 347 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-13 10:40:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 288. [2024-10-13 10:40:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 234 states have (on average 1.5) internal successors, (351), 275 states have internal predecessors, (351), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 369 transitions. [2024-10-13 10:40:26,427 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 369 transitions. Word has length 29 [2024-10-13 10:40:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 369 transitions. [2024-10-13 10:40:26,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 369 transitions. [2024-10-13 10:40:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:40:26,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:26,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:26,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 10:40:26,429 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 546469545, now seen corresponding path program 1 times [2024-10-13 10:40:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:26,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990516221] [2024-10-13 10:40:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:26,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990516221] [2024-10-13 10:40:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990516221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226640015] [2024-10-13 10:40:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:40:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:40:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:40:26,651 INFO L87 Difference]: Start difference. First operand 288 states and 369 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:26,878 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2024-10-13 10:40:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:40:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-13 10:40:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:26,880 INFO L225 Difference]: With dead ends: 425 [2024-10-13 10:40:26,880 INFO L226 Difference]: Without dead ends: 425 [2024-10-13 10:40:26,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:40:26,881 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 277 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:26,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 510 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-13 10:40:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 399. [2024-10-13 10:40:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 345 states have (on average 1.5159420289855072) internal successors, (523), 386 states have internal predecessors, (523), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 541 transitions. [2024-10-13 10:40:26,891 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 541 transitions. Word has length 29 [2024-10-13 10:40:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 541 transitions. [2024-10-13 10:40:26,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 541 transitions. [2024-10-13 10:40:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:40:26,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:26,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 10:40:26,892 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 546469706, now seen corresponding path program 1 times [2024-10-13 10:40:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405296733] [2024-10-13 10:40:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405296733] [2024-10-13 10:40:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405296733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:27,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:40:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792913717] [2024-10-13 10:40:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:40:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:40:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:40:27,086 INFO L87 Difference]: Start difference. First operand 399 states and 541 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:27,339 INFO L93 Difference]: Finished difference Result 458 states and 586 transitions. [2024-10-13 10:40:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:40:27,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-13 10:40:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:27,342 INFO L225 Difference]: With dead ends: 458 [2024-10-13 10:40:27,342 INFO L226 Difference]: Without dead ends: 458 [2024-10-13 10:40:27,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:27,342 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 146 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:27,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 288 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-13 10:40:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 342. [2024-10-13 10:40:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 288 states have (on average 1.5034722222222223) internal successors, (433), 329 states have internal predecessors, (433), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 451 transitions. [2024-10-13 10:40:27,352 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 451 transitions. Word has length 29 [2024-10-13 10:40:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 451 transitions. [2024-10-13 10:40:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 451 transitions. [2024-10-13 10:40:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:40:27,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:27,353 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] [2024-10-13 10:40:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 10:40:27,354 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -977755367, now seen corresponding path program 1 times [2024-10-13 10:40:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460228698] [2024-10-13 10:40:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460228698] [2024-10-13 10:40:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460228698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:28,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:40:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608922582] [2024-10-13 10:40:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:28,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:40:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:40:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:28,011 INFO L87 Difference]: Start difference. First operand 342 states and 451 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:28,526 INFO L93 Difference]: Finished difference Result 365 states and 475 transitions. [2024-10-13 10:40:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:40:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-10-13 10:40:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:28,530 INFO L225 Difference]: With dead ends: 365 [2024-10-13 10:40:28,530 INFO L226 Difference]: Without dead ends: 365 [2024-10-13 10:40:28,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:40:28,531 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 64 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:28,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 865 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-13 10:40:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2024-10-13 10:40:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 305 states have (on average 1.478688524590164) internal successors, (451), 346 states have internal predecessors, (451), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 469 transitions. [2024-10-13 10:40:28,539 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 469 transitions. Word has length 42 [2024-10-13 10:40:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:28,539 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 469 transitions. [2024-10-13 10:40:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 469 transitions. [2024-10-13 10:40:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:40:28,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:28,540 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] [2024-10-13 10:40:28,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 10:40:28,541 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1208703882, now seen corresponding path program 1 times [2024-10-13 10:40:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796407133] [2024-10-13 10:40:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:29,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796407133] [2024-10-13 10:40:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796407133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:40:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2602632] [2024-10-13 10:40:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:29,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:40:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:40:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:29,041 INFO L87 Difference]: Start difference. First operand 359 states and 469 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:29,474 INFO L93 Difference]: Finished difference Result 457 states and 556 transitions. [2024-10-13 10:40:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:40:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-13 10:40:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:29,477 INFO L225 Difference]: With dead ends: 457 [2024-10-13 10:40:29,477 INFO L226 Difference]: Without dead ends: 457 [2024-10-13 10:40:29,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:40:29,477 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 229 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:29,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 534 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-13 10:40:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 382. [2024-10-13 10:40:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 328 states have (on average 1.4603658536585367) internal successors, (479), 369 states have internal predecessors, (479), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 497 transitions. [2024-10-13 10:40:29,485 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 497 transitions. Word has length 43 [2024-10-13 10:40:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:29,486 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 497 transitions. [2024-10-13 10:40:29,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 497 transitions. [2024-10-13 10:40:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:40:29,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:29,487 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] [2024-10-13 10:40:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 10:40:29,487 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:29,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 363315233, now seen corresponding path program 1 times [2024-10-13 10:40:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199245193] [2024-10-13 10:40:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199245193] [2024-10-13 10:40:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199245193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 10:40:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233960849] [2024-10-13 10:40:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:40:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:40:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:40:30,323 INFO L87 Difference]: Start difference. First operand 382 states and 497 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:31,044 INFO L93 Difference]: Finished difference Result 456 states and 558 transitions. [2024-10-13 10:40:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:40:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-13 10:40:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:31,047 INFO L225 Difference]: With dead ends: 456 [2024-10-13 10:40:31,047 INFO L226 Difference]: Without dead ends: 456 [2024-10-13 10:40:31,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:40:31,048 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 214 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:31,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 892 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:40:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-13 10:40:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 377. [2024-10-13 10:40:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 323 states have (on average 1.4767801857585139) internal successors, (477), 364 states have internal predecessors, (477), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-13 10:40:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 495 transitions. [2024-10-13 10:40:31,055 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 495 transitions. Word has length 43 [2024-10-13 10:40:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:31,055 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 495 transitions. [2024-10-13 10:40:31,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 495 transitions. [2024-10-13 10:40:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:31,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:31,056 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] [2024-10-13 10:40:31,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 10:40:31,057 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -156608335, now seen corresponding path program 1 times [2024-10-13 10:40:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235263602] [2024-10-13 10:40:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235263602] [2024-10-13 10:40:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235263602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 10:40:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849077341] [2024-10-13 10:40:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:31,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:40:31,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:40:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:40:31,746 INFO L87 Difference]: Start difference. First operand 377 states and 495 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:32,420 INFO L93 Difference]: Finished difference Result 657 states and 846 transitions. [2024-10-13 10:40:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:40:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:32,424 INFO L225 Difference]: With dead ends: 657 [2024-10-13 10:40:32,424 INFO L226 Difference]: Without dead ends: 657 [2024-10-13 10:40:32,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:40:32,425 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 402 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:32,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1119 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:40:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-13 10:40:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 453. [2024-10-13 10:40:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 436 states have internal predecessors, (571), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-13 10:40:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 601 transitions. [2024-10-13 10:40:32,437 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 601 transitions. Word has length 44 [2024-10-13 10:40:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:32,437 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 601 transitions. [2024-10-13 10:40:32,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 601 transitions. [2024-10-13 10:40:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:32,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:32,438 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] [2024-10-13 10:40:32,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 10:40:32,438 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:32,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash -156608334, now seen corresponding path program 1 times [2024-10-13 10:40:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:32,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218055215] [2024-10-13 10:40:32,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218055215] [2024-10-13 10:40:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218055215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 10:40:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351106982] [2024-10-13 10:40:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:40:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:40:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:40:33,244 INFO L87 Difference]: Start difference. First operand 453 states and 601 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:33,969 INFO L93 Difference]: Finished difference Result 719 states and 932 transitions. [2024-10-13 10:40:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:40:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:33,972 INFO L225 Difference]: With dead ends: 719 [2024-10-13 10:40:33,972 INFO L226 Difference]: Without dead ends: 719 [2024-10-13 10:40:33,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:40:33,973 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 366 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:33,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1055 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:40:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-13 10:40:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 528. [2024-10-13 10:40:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 459 states have (on average 1.4662309368191722) internal successors, (673), 507 states have internal predecessors, (673), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2024-10-13 10:40:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 715 transitions. [2024-10-13 10:40:33,985 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 715 transitions. Word has length 44 [2024-10-13 10:40:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:33,985 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 715 transitions. [2024-10-13 10:40:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 715 transitions. [2024-10-13 10:40:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:33,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:33,986 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] [2024-10-13 10:40:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 10:40:33,986 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:33,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash -156548753, now seen corresponding path program 1 times [2024-10-13 10:40:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204008766] [2024-10-13 10:40:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204008766] [2024-10-13 10:40:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204008766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151327958] [2024-10-13 10:40:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:34,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:34,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:34,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:40:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:35,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:40:35,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:35,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:40:35,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:40:35,720 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 21 treesize of output 9 [2024-10-13 10:40:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:35,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:40:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151327958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:35,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:40:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-10-13 10:40:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991873702] [2024-10-13 10:40:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:35,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:40:35,727 INFO L87 Difference]: Start difference. First operand 528 states and 715 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:36,123 INFO L93 Difference]: Finished difference Result 837 states and 1126 transitions. [2024-10-13 10:40:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:40:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:36,127 INFO L225 Difference]: With dead ends: 837 [2024-10-13 10:40:36,127 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 10:40:36,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:40:36,128 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 262 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:36,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 511 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 10:40:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 634. [2024-10-13 10:40:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 549 states have (on average 1.4571948998178506) internal successors, (800), 605 states have internal predecessors, (800), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-10-13 10:40:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 866 transitions. [2024-10-13 10:40:36,147 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 866 transitions. Word has length 44 [2024-10-13 10:40:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:36,148 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 866 transitions. [2024-10-13 10:40:36,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 866 transitions. [2024-10-13 10:40:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:36,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:36,149 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] [2024-10-13 10:40:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:40:36,350 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,SelfDestructingSolverStorable37 [2024-10-13 10:40:36,350 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:36,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash -156548752, now seen corresponding path program 1 times [2024-10-13 10:40:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:36,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171290034] [2024-10-13 10:40:36,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171290034] [2024-10-13 10:40:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171290034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347770224] [2024-10-13 10:40:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:37,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:37,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:40:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:37,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 10:40:37,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:37,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:40:38,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:40:38,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:40:38,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:40:38,320 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 21 treesize of output 9 [2024-10-13 10:40:38,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:40:38,326 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 19 treesize of output 7 [2024-10-13 10:40:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:38,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:40:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347770224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:40:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 22 [2024-10-13 10:40:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471915164] [2024-10-13 10:40:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:40:38,359 INFO L87 Difference]: Start difference. First operand 634 states and 866 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:38,800 INFO L93 Difference]: Finished difference Result 905 states and 1228 transitions. [2024-10-13 10:40:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:40:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:38,803 INFO L225 Difference]: With dead ends: 905 [2024-10-13 10:40:38,803 INFO L226 Difference]: Without dead ends: 905 [2024-10-13 10:40:38,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:40:38,805 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 308 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:38,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 682 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:40:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-13 10:40:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 708. [2024-10-13 10:40:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 615 states have (on average 1.4747967479674797) internal successors, (907), 675 states have internal predecessors, (907), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2024-10-13 10:40:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2024-10-13 10:40:38,821 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 44 [2024-10-13 10:40:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2024-10-13 10:40:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2024-10-13 10:40:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:38,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:38,823 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] [2024-10-13 10:40:38,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:40:39,023 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,SelfDestructingSolverStorable38 [2024-10-13 10:40:39,024 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 866287478, now seen corresponding path program 1 times [2024-10-13 10:40:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717278525] [2024-10-13 10:40:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717278525] [2024-10-13 10:40:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717278525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:40:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523474469] [2024-10-13 10:40:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:39,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:39,256 INFO L87 Difference]: Start difference. First operand 708 states and 985 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:39,537 INFO L93 Difference]: Finished difference Result 983 states and 1353 transitions. [2024-10-13 10:40:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:40:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:39,540 INFO L225 Difference]: With dead ends: 983 [2024-10-13 10:40:39,541 INFO L226 Difference]: Without dead ends: 983 [2024-10-13 10:40:39,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:40:39,541 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 346 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:39,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 569 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-10-13 10:40:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 760. [2024-10-13 10:40:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 659 states have (on average 1.4704097116843702) internal successors, (969), 723 states have internal predecessors, (969), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2024-10-13 10:40:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1059 transitions. [2024-10-13 10:40:39,557 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1059 transitions. Word has length 44 [2024-10-13 10:40:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:39,558 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1059 transitions. [2024-10-13 10:40:39,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1059 transitions. [2024-10-13 10:40:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:39,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:39,559 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] [2024-10-13 10:40:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-13 10:40:39,559 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 866287479, now seen corresponding path program 1 times [2024-10-13 10:40:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670105528] [2024-10-13 10:40:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670105528] [2024-10-13 10:40:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670105528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:40:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154729273] [2024-10-13 10:40:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:39,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:39,968 INFO L87 Difference]: Start difference. First operand 760 states and 1059 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:40,290 INFO L93 Difference]: Finished difference Result 1035 states and 1426 transitions. [2024-10-13 10:40:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:40:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:40,295 INFO L225 Difference]: With dead ends: 1035 [2024-10-13 10:40:40,295 INFO L226 Difference]: Without dead ends: 1035 [2024-10-13 10:40:40,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:40:40,296 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 309 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:40,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 564 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-10-13 10:40:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 602. [2024-10-13 10:40:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 521 states have (on average 1.4817658349328215) internal successors, (772), 575 states have internal predecessors, (772), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-10-13 10:40:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 832 transitions. [2024-10-13 10:40:40,309 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 832 transitions. Word has length 44 [2024-10-13 10:40:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:40,309 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 832 transitions. [2024-10-13 10:40:40,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 832 transitions. [2024-10-13 10:40:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:40,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:40,310 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] [2024-10-13 10:40:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-13 10:40:40,311 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:40,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash 866347060, now seen corresponding path program 1 times [2024-10-13 10:40:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480328097] [2024-10-13 10:40:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480328097] [2024-10-13 10:40:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480328097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768057560] [2024-10-13 10:40:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:40,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:40,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:40:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:40,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 10:40:40,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:41,043 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-10-13 10:40:41,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-13 10:40:41,252 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 28 treesize of output 12 [2024-10-13 10:40:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:41,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:40:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768057560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:41,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:40:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-10-13 10:40:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627304083] [2024-10-13 10:40:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:40:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:40:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:40:41,278 INFO L87 Difference]: Start difference. First operand 602 states and 832 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:41,810 INFO L93 Difference]: Finished difference Result 941 states and 1269 transitions. [2024-10-13 10:40:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:40:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:41,814 INFO L225 Difference]: With dead ends: 941 [2024-10-13 10:40:41,814 INFO L226 Difference]: Without dead ends: 941 [2024-10-13 10:40:41,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:40:41,815 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 250 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:41,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1403 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:40:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-13 10:40:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 675. [2024-10-13 10:40:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 586 states have (on average 1.469283276450512) internal successors, (861), 644 states have internal predecessors, (861), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2024-10-13 10:40:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 933 transitions. [2024-10-13 10:40:41,828 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 933 transitions. Word has length 44 [2024-10-13 10:40:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 933 transitions. [2024-10-13 10:40:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 933 transitions. [2024-10-13 10:40:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:40:41,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:41,829 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] [2024-10-13 10:40:41,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:40:42,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:42,030 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:42,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash 866347061, now seen corresponding path program 1 times [2024-10-13 10:40:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463685642] [2024-10-13 10:40:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:42,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:42,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:42,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:42,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463685642] [2024-10-13 10:40:42,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463685642] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:42,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368212629] [2024-10-13 10:40:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:42,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:42,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:42,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:40:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:42,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 10:40:42,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:42,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:40:42,982 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-10-13 10:40:42,987 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-10-13 10:40:43,046 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-10-13 10:40:43,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-13 10:40:43,215 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 28 treesize of output 12 [2024-10-13 10:40:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:43,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:40:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368212629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:43,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:40:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-13 10:40:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308797393] [2024-10-13 10:40:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:43,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:40:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:40:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:40:43,242 INFO L87 Difference]: Start difference. First operand 675 states and 933 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:43,851 INFO L93 Difference]: Finished difference Result 921 states and 1240 transitions. [2024-10-13 10:40:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:40:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-13 10:40:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:43,854 INFO L225 Difference]: With dead ends: 921 [2024-10-13 10:40:43,854 INFO L226 Difference]: Without dead ends: 921 [2024-10-13 10:40:43,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:40:43,855 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 250 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:43,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1537 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:40:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-13 10:40:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 623. [2024-10-13 10:40:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 542 states have (on average 1.4741697416974169) internal successors, (799), 596 states have internal predecessors, (799), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-10-13 10:40:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 859 transitions. [2024-10-13 10:40:43,872 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 859 transitions. Word has length 44 [2024-10-13 10:40:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:43,874 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 859 transitions. [2024-10-13 10:40:43,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 859 transitions. [2024-10-13 10:40:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:40:43,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:43,875 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] [2024-10-13 10:40:43,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:40:44,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:44,076 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -559892351, now seen corresponding path program 1 times [2024-10-13 10:40:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685711817] [2024-10-13 10:40:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685711817] [2024-10-13 10:40:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685711817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 10:40:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654878894] [2024-10-13 10:40:44,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:40:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:40:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:40:44,539 INFO L87 Difference]: Start difference. First operand 623 states and 859 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:44,932 INFO L93 Difference]: Finished difference Result 1012 states and 1373 transitions. [2024-10-13 10:40:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:40:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-13 10:40:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:44,936 INFO L225 Difference]: With dead ends: 1012 [2024-10-13 10:40:44,936 INFO L226 Difference]: Without dead ends: 1012 [2024-10-13 10:40:44,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:40:44,937 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 394 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:44,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1073 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-13 10:40:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 810. [2024-10-13 10:40:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 705 states have (on average 1.478014184397163) internal successors, (1042), 771 states have internal predecessors, (1042), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-10-13 10:40:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1138 transitions. [2024-10-13 10:40:44,950 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1138 transitions. Word has length 45 [2024-10-13 10:40:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:44,950 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1138 transitions. [2024-10-13 10:40:44,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1138 transitions. [2024-10-13 10:40:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:40:44,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:44,951 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] [2024-10-13 10:40:44,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-13 10:40:44,951 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:44,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash -558045309, now seen corresponding path program 1 times [2024-10-13 10:40:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:44,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401137444] [2024-10-13 10:40:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401137444] [2024-10-13 10:40:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401137444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:45,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800267675] [2024-10-13 10:40:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:45,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:45,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:45,107 INFO L87 Difference]: Start difference. First operand 810 states and 1138 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:45,308 INFO L93 Difference]: Finished difference Result 1230 states and 1717 transitions. [2024-10-13 10:40:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:40:45,309 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-13 10:40:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:45,314 INFO L225 Difference]: With dead ends: 1230 [2024-10-13 10:40:45,315 INFO L226 Difference]: Without dead ends: 1230 [2024-10-13 10:40:45,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:45,315 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 138 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:45,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 668 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-10-13 10:40:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1028. [2024-10-13 10:40:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 895 states have (on average 1.4837988826815642) internal successors, (1328), 975 states have internal predecessors, (1328), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-10-13 10:40:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1466 transitions. [2024-10-13 10:40:45,336 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1466 transitions. Word has length 45 [2024-10-13 10:40:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:45,336 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1466 transitions. [2024-10-13 10:40:45,337 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1466 transitions. [2024-10-13 10:40:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:40:45,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:45,338 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] [2024-10-13 10:40:45,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-13 10:40:45,338 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1085106780, now seen corresponding path program 1 times [2024-10-13 10:40:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725708740] [2024-10-13 10:40:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725708740] [2024-10-13 10:40:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725708740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:40:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976496766] [2024-10-13 10:40:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:45,555 INFO L87 Difference]: Start difference. First operand 1028 states and 1466 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:45,819 INFO L93 Difference]: Finished difference Result 1263 states and 1767 transitions. [2024-10-13 10:40:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:40:45,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-13 10:40:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:45,824 INFO L225 Difference]: With dead ends: 1263 [2024-10-13 10:40:45,824 INFO L226 Difference]: Without dead ends: 1263 [2024-10-13 10:40:45,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:40:45,825 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 340 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:45,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 770 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-13 10:40:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 846. [2024-10-13 10:40:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 737 states have (on average 1.4816824966078697) internal successors, (1092), 805 states have internal predecessors, (1092), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-10-13 10:40:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1194 transitions. [2024-10-13 10:40:45,846 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1194 transitions. Word has length 45 [2024-10-13 10:40:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:45,847 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1194 transitions. [2024-10-13 10:40:45,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1194 transitions. [2024-10-13 10:40:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:40:45,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:45,848 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] [2024-10-13 10:40:45,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-13 10:40:45,848 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1086953822, now seen corresponding path program 1 times [2024-10-13 10:40:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051683480] [2024-10-13 10:40:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:46,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:46,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051683480] [2024-10-13 10:40:46,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051683480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:46,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:46,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:40:46,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970666633] [2024-10-13 10:40:46,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:46,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:46,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:46,029 INFO L87 Difference]: Start difference. First operand 846 states and 1194 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:46,262 INFO L93 Difference]: Finished difference Result 1072 states and 1482 transitions. [2024-10-13 10:40:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:40:46,262 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-13 10:40:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:46,265 INFO L225 Difference]: With dead ends: 1072 [2024-10-13 10:40:46,265 INFO L226 Difference]: Without dead ends: 1072 [2024-10-13 10:40:46,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:46,265 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 123 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:46,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 899 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-13 10:40:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 665. [2024-10-13 10:40:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 580 states have (on average 1.4793103448275862) internal successors, (858), 636 states have internal predecessors, (858), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-10-13 10:40:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 924 transitions. [2024-10-13 10:40:46,277 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 924 transitions. Word has length 45 [2024-10-13 10:40:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:46,277 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 924 transitions. [2024-10-13 10:40:46,277 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 924 transitions. [2024-10-13 10:40:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 10:40:46,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:46,278 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] [2024-10-13 10:40:46,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-13 10:40:46,278 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:46,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -176716848, now seen corresponding path program 1 times [2024-10-13 10:40:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050178096] [2024-10-13 10:40:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050178096] [2024-10-13 10:40:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050178096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:46,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:40:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864218140] [2024-10-13 10:40:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:46,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:40:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:40:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:40:46,811 INFO L87 Difference]: Start difference. First operand 665 states and 924 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:47,191 INFO L93 Difference]: Finished difference Result 1054 states and 1435 transitions. [2024-10-13 10:40:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:40:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-13 10:40:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:47,197 INFO L225 Difference]: With dead ends: 1054 [2024-10-13 10:40:47,197 INFO L226 Difference]: Without dead ends: 1054 [2024-10-13 10:40:47,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:40:47,198 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 464 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:47,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 879 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-13 10:40:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 856. [2024-10-13 10:40:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 747 states have (on average 1.4805890227576974) internal successors, (1106), 815 states have internal predecessors, (1106), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-10-13 10:40:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1208 transitions. [2024-10-13 10:40:47,221 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1208 transitions. Word has length 46 [2024-10-13 10:40:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:47,222 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1208 transitions. [2024-10-13 10:40:47,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1208 transitions. [2024-10-13 10:40:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 10:40:47,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:47,226 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] [2024-10-13 10:40:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-13 10:40:47,226 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:47,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -119458546, now seen corresponding path program 1 times [2024-10-13 10:40:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232140238] [2024-10-13 10:40:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:47,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:47,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232140238] [2024-10-13 10:40:47,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232140238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:47,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:47,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:40:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835209502] [2024-10-13 10:40:47,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:47,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:40:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:40:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:40:47,400 INFO L87 Difference]: Start difference. First operand 856 states and 1208 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:47,606 INFO L93 Difference]: Finished difference Result 1279 states and 1788 transitions. [2024-10-13 10:40:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:40:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-13 10:40:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:47,610 INFO L225 Difference]: With dead ends: 1279 [2024-10-13 10:40:47,610 INFO L226 Difference]: Without dead ends: 1279 [2024-10-13 10:40:47,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:47,611 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 136 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:47,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 500 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-10-13 10:40:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1076. [2024-10-13 10:40:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 939 states have (on average 1.4877529286474973) internal successors, (1397), 1021 states have internal predecessors, (1397), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2024-10-13 10:40:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1541 transitions. [2024-10-13 10:40:47,627 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1541 transitions. Word has length 46 [2024-10-13 10:40:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:47,628 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1541 transitions. [2024-10-13 10:40:47,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1541 transitions. [2024-10-13 10:40:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 10:40:47,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:47,629 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] [2024-10-13 10:40:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-13 10:40:47,629 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -721351339, now seen corresponding path program 1 times [2024-10-13 10:40:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544710697] [2024-10-13 10:40:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:47,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544710697] [2024-10-13 10:40:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544710697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:40:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952608580] [2024-10-13 10:40:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:40:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:40:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:40:47,882 INFO L87 Difference]: Start difference. First operand 1076 states and 1541 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:48,117 INFO L93 Difference]: Finished difference Result 1316 states and 1847 transitions. [2024-10-13 10:40:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:40:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-13 10:40:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:48,122 INFO L225 Difference]: With dead ends: 1316 [2024-10-13 10:40:48,122 INFO L226 Difference]: Without dead ends: 1316 [2024-10-13 10:40:48,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:40:48,123 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 332 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:48,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 589 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:40:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-10-13 10:40:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 894. [2024-10-13 10:40:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 781 states have (on average 1.4865556978233034) internal successors, (1161), 851 states have internal predecessors, (1161), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-13 10:40:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1269 transitions. [2024-10-13 10:40:48,147 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1269 transitions. Word has length 46 [2024-10-13 10:40:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:48,148 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1269 transitions. [2024-10-13 10:40:48,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1269 transitions. [2024-10-13 10:40:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 10:40:48,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:48,149 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] [2024-10-13 10:40:48,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-13 10:40:48,150 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -664093037, now seen corresponding path program 1 times [2024-10-13 10:40:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082355035] [2024-10-13 10:40:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082355035] [2024-10-13 10:40:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082355035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922167359] [2024-10-13 10:40:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:48,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:48,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:40:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:48,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 10:40:48,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:48,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:40:48,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:40:48,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 10:40:49,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 10:40:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:49,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:40:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922167359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:40:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-13 10:40:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804627654] [2024-10-13 10:40:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:49,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:40:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:40:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:40:49,065 INFO L87 Difference]: Start difference. First operand 894 states and 1269 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:49,417 INFO L93 Difference]: Finished difference Result 1170 states and 1614 transitions. [2024-10-13 10:40:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:40:49,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-13 10:40:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:49,426 INFO L225 Difference]: With dead ends: 1170 [2024-10-13 10:40:49,426 INFO L226 Difference]: Without dead ends: 1170 [2024-10-13 10:40:49,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:40:49,427 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 295 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:49,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1129 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-10-13 10:40:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 803. [2024-10-13 10:40:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 702 states have (on average 1.4886039886039886) internal successors, (1045), 766 states have internal predecessors, (1045), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2024-10-13 10:40:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1135 transitions. [2024-10-13 10:40:49,442 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1135 transitions. Word has length 46 [2024-10-13 10:40:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1135 transitions. [2024-10-13 10:40:49,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:40:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1135 transitions. [2024-10-13 10:40:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:40:49,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:49,443 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 10:40:49,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:40:49,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:49,648 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:49,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1259808537, now seen corresponding path program 1 times [2024-10-13 10:40:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:49,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717719576] [2024-10-13 10:40:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:49,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 10:40:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:40:50,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717719576] [2024-10-13 10:40:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717719576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851682961] [2024-10-13 10:40:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:50,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:50,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:50,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:40:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:50,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 10:40:50,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:50,377 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 11 treesize of output 7 [2024-10-13 10:40:50,415 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 19 [2024-10-13 10:40:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:40:50,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:40:50,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2024-10-13 10:40:50,574 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 69 treesize of output 49 [2024-10-13 10:40:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:50,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:40:50,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:40:50,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2024-10-13 10:40:50,992 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 74 treesize of output 70 [2024-10-13 10:40:51,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:40:51,026 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:40:51,030 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 22 treesize of output 18 [2024-10-13 10:40:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:40:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851682961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:40:51,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:40:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-13 10:40:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874485591] [2024-10-13 10:40:51,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:40:51,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 10:40:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 10:40:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:40:51,196 INFO L87 Difference]: Start difference. First operand 803 states and 1135 transitions. Second operand has 27 states, 27 states have (on average 4.444444444444445) internal successors, (120), 27 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:40:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:51,751 INFO L93 Difference]: Finished difference Result 1065 states and 1474 transitions. [2024-10-13 10:40:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:40:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.444444444444445) internal successors, (120), 27 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2024-10-13 10:40:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:51,753 INFO L225 Difference]: With dead ends: 1065 [2024-10-13 10:40:51,754 INFO L226 Difference]: Without dead ends: 1065 [2024-10-13 10:40:51,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 10:40:51,754 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 966 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:51,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1588 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:40:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-13 10:40:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 878. [2024-10-13 10:40:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 765 states have (on average 1.4836601307189543) internal successors, (1135), 835 states have internal predecessors, (1135), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-13 10:40:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1243 transitions. [2024-10-13 10:40:51,767 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1243 transitions. Word has length 48 [2024-10-13 10:40:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:51,768 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1243 transitions. [2024-10-13 10:40:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.444444444444445) internal successors, (120), 27 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:40:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1243 transitions. [2024-10-13 10:40:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:40:51,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:51,768 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] [2024-10-13 10:40:51,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:40:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:51,969 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1852072798, now seen corresponding path program 1 times [2024-10-13 10:40:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106588088] [2024-10-13 10:40:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 10:40:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:40:52,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106588088] [2024-10-13 10:40:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106588088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874987181] [2024-10-13 10:40:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:52,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:52,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:40:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:52,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 10:40:52,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:52,964 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 11 treesize of output 7 [2024-10-13 10:40:53,016 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 19 [2024-10-13 10:40:53,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:40:53,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:40:53,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2024-10-13 10:40:53,224 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 69 treesize of output 49 [2024-10-13 10:40:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:53,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:40:53,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:40:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2024-10-13 10:40:53,621 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 74 treesize of output 70 [2024-10-13 10:40:53,644 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 74 treesize of output 70 [2024-10-13 10:40:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:40:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874987181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:40:54,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:40:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2024-10-13 10:40:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144132055] [2024-10-13 10:40:54,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:40:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 10:40:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 10:40:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:40:54,040 INFO L87 Difference]: Start difference. First operand 878 states and 1243 transitions. Second operand has 32 states, 32 states have (on average 3.875) internal successors, (124), 29 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:40:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:55,085 INFO L93 Difference]: Finished difference Result 1150 states and 1577 transitions. [2024-10-13 10:40:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:40:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.875) internal successors, (124), 29 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2024-10-13 10:40:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:55,088 INFO L225 Difference]: With dead ends: 1150 [2024-10-13 10:40:55,088 INFO L226 Difference]: Without dead ends: 1150 [2024-10-13 10:40:55,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1650, Unknown=0, NotChecked=0, Total=1892 [2024-10-13 10:40:55,088 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 648 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:55,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 3699 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:40:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-13 10:40:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 797. [2024-10-13 10:40:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 696 states have (on average 1.4827586206896552) internal successors, (1032), 760 states have internal predecessors, (1032), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2024-10-13 10:40:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1122 transitions. [2024-10-13 10:40:55,110 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1122 transitions. Word has length 48 [2024-10-13 10:40:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:55,111 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1122 transitions. [2024-10-13 10:40:55,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.875) internal successors, (124), 29 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:40:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1122 transitions. [2024-10-13 10:40:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:40:55,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:55,112 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 10:40:55,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:40:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:55,317 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 399721909, now seen corresponding path program 1 times [2024-10-13 10:40:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871310967] [2024-10-13 10:40:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 10:40:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:40:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871310967] [2024-10-13 10:40:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871310967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:40:55,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:40:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:40:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071967842] [2024-10-13 10:40:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:40:55,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:40:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:55,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:40:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:40:55,450 INFO L87 Difference]: Start difference. First operand 797 states and 1122 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:40:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:55,598 INFO L93 Difference]: Finished difference Result 800 states and 1105 transitions. [2024-10-13 10:40:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:40:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-10-13 10:40:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:55,600 INFO L225 Difference]: With dead ends: 800 [2024-10-13 10:40:55,600 INFO L226 Difference]: Without dead ends: 800 [2024-10-13 10:40:55,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:40:55,601 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 136 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:55,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 321 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:40:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-13 10:40:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2024-10-13 10:40:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 696 states have (on average 1.4497126436781609) internal successors, (1009), 757 states have internal predecessors, (1009), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2024-10-13 10:40:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1099 transitions. [2024-10-13 10:40:55,611 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1099 transitions. Word has length 49 [2024-10-13 10:40:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:55,611 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1099 transitions. [2024-10-13 10:40:55,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:40:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1099 transitions. [2024-10-13 10:40:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:40:55,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:55,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-13 10:40:55,612 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666086, now seen corresponding path program 1 times [2024-10-13 10:40:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241119546] [2024-10-13 10:40:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 10:40:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:40:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241119546] [2024-10-13 10:40:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241119546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351907584] [2024-10-13 10:40:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:56,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:56,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:56,111 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:56,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:40:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:56,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-13 10:40:56,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:56,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-10-13 10:40:56,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 22 [2024-10-13 10:40:56,519 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-13 10:40:56,519 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 25 treesize of output 28 [2024-10-13 10:40:56,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:40:56,570 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 32 treesize of output 12 [2024-10-13 10:40:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:40:56,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:40:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351907584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:56,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:40:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2024-10-13 10:40:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513009954] [2024-10-13 10:40:56,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:40:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:40:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:40:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:40:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:40:56,641 INFO L87 Difference]: Start difference. First operand 794 states and 1099 transitions. Second operand has 21 states, 20 states have (on average 4.3) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:40:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:40:57,552 INFO L93 Difference]: Finished difference Result 1282 states and 1719 transitions. [2024-10-13 10:40:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:40:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-10-13 10:40:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:40:57,555 INFO L225 Difference]: With dead ends: 1282 [2024-10-13 10:40:57,555 INFO L226 Difference]: Without dead ends: 1282 [2024-10-13 10:40:57,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 10:40:57,557 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 804 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:40:57,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1663 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:40:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-13 10:40:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 854. [2024-10-13 10:40:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 748 states have (on average 1.4438502673796791) internal successors, (1080), 811 states have internal predecessors, (1080), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 25 states have call predecessors, (68), 34 states have call successors, (68) [2024-10-13 10:40:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1182 transitions. [2024-10-13 10:40:57,574 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1182 transitions. Word has length 49 [2024-10-13 10:40:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:40:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1182 transitions. [2024-10-13 10:40:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:40:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1182 transitions. [2024-10-13 10:40:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:40:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:40:57,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:40:57,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:40:57,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-10-13 10:40:57,776 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-13 10:40:57,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:40:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666087, now seen corresponding path program 1 times [2024-10-13 10:40:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:40:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293488644] [2024-10-13 10:40:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:40:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:40:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 10:40:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:40:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:40:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293488644] [2024-10-13 10:40:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293488644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:40:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877665249] [2024-10-13 10:40:58,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:40:58,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:40:58,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:40:58,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:40:58,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:40:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:40:59,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-13 10:40:59,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:40:59,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:40:59,336 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-10-13 10:40:59,347 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-10-13 10:40:59,410 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 21 treesize of output 20 [2024-10-13 10:40:59,414 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 36 treesize of output 27 [2024-10-13 10:40:59,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:40:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-13 10:40:59,544 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-10-13 10:40:59,545 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 19 treesize of output 19 [2024-10-13 10:41:03,776 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 30 treesize of output 12 [2024-10-13 10:41:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:03,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:41:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877665249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:41:04,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:41:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 28 [2024-10-13 10:41:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944272156] [2024-10-13 10:41:04,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:41:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 10:41:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 10:41:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1023, Unknown=1, NotChecked=0, Total=1122 [2024-10-13 10:41:04,044 INFO L87 Difference]: Start difference. First operand 854 states and 1182 transitions. Second operand has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:41:09,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:41:25,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:41:29,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]