./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:56:59,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:56:59,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:56:59,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:56:59,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:56:59,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:56:59,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:56:59,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:56:59,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:56:59,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:56:59,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:56:59,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:56:59,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:56:59,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:56:59,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:56:59,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:56:59,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:56:59,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:56:59,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:56:59,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:56:59,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:56:59,327 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:56:59,327 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:56:59,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:56:59,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:56:59,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:56:59,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:56:59,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:56:59,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:56:59,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:56:59,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:56:59,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:56:59,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:56:59,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:59,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:56:59,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:56:59,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:56:59,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:56:59,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:56:59,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:56:59,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:56:59,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:56:59,333 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-clean/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-clean/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-11 17:56:59,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:56:59,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:56:59,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:56:59,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:56:59,613 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:56:59,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-10-11 17:57:01,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:57:01,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:57:01,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-10-11 17:57:01,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65f75cb89/18e80d8f8fa24d9abfb228322eeed4d8/FLAG53726306e [2024-10-11 17:57:01,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65f75cb89/18e80d8f8fa24d9abfb228322eeed4d8 [2024-10-11 17:57:01,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:57:01,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:57:01,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:01,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:57:01,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:57:01,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:01" (1/1) ... [2024-10-11 17:57:01,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d07fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:01, skipping insertion in model container [2024-10-11 17:57:01,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:01" (1/1) ... [2024-10-11 17:57:01,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:57:02,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:02,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:57:02,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:02,226 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:57:02,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02 WrapperNode [2024-10-11 17:57:02,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:02,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:02,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:57:02,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:57:02,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,300 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-10-11 17:57:02,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:02,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:57:02,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:57:02,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:57:02,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,354 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-11 17:57:02,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:57:02,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:57:02,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:57:02,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:57:02,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (1/1) ... [2024-10-11 17:57:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:57:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:02,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:57:02,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:57:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-11 17:57:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-11 17:57:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:57:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:57:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:57:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:57:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:57:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:57:02,564 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:57:02,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:57:03,084 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-11 17:57:03,085 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:57:03,149 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:57:03,149 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 17:57:03,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:03 BoogieIcfgContainer [2024-10-11 17:57:03,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:57:03,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:57:03,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:57:03,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:57:03,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:57:01" (1/3) ... [2024-10-11 17:57:03,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482df9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:03, skipping insertion in model container [2024-10-11 17:57:03,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:02" (2/3) ... [2024-10-11 17:57:03,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482df9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:03, skipping insertion in model container [2024-10-11 17:57:03,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:03" (3/3) ... [2024-10-11 17:57:03,160 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2024-10-11 17:57:03,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:57:03,178 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-11 17:57:03,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:57:03,234 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;@67e0bd5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:57:03,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-11 17:57:03,240 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-11 17:57:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:57:03,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:03,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:57:03,248 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-11 17:57:03,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 319878969, now seen corresponding path program 1 times [2024-10-11 17:57:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:03,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183448301] [2024-10-11 17:57:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:03,415 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-11 17:57:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183448301] [2024-10-11 17:57:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183448301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772503829] [2024-10-11 17:57:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:57:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:03,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:57:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:57:03,457 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-11 17:57:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:03,530 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2024-10-11 17:57:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:57:03,532 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-11 17:57:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:03,541 INFO L225 Difference]: With dead ends: 145 [2024-10-11 17:57:03,542 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 17:57:03,544 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-11 17:57:03,549 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-11 17:57:03,551 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-11 17:57:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 17:57:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-11 17:57:03,589 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-11 17:57:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-10-11 17:57:03,592 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 5 [2024-10-11 17:57:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:03,592 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-10-11 17:57:03,592 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-11 17:57:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-10-11 17:57:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:57:03,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:03,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:57:03,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:57:03,593 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-11 17:57:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452205, now seen corresponding path program 1 times [2024-10-11 17:57:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978381011] [2024-10-11 17:57:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:03,704 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-11 17:57:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978381011] [2024-10-11 17:57:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978381011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:57:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727150457] [2024-10-11 17:57:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:03,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:03,708 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-11 17:57:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:03,963 INFO L93 Difference]: Finished difference Result 281 states and 318 transitions. [2024-10-11 17:57:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:03,963 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-11 17:57:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:03,966 INFO L225 Difference]: With dead ends: 281 [2024-10-11 17:57:03,968 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 17:57:03,969 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-11 17:57:03,970 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-11 17:57:03,972 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-11 17:57:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 17:57:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 195. [2024-10-11 17:57:03,996 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-11 17:57:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-11 17:57:04,000 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 6 [2024-10-11 17:57:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,001 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-11 17:57:04,001 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-11 17:57:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-11 17:57:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:57:04,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:57:04,002 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-11 17:57:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452206, now seen corresponding path program 1 times [2024-10-11 17:57:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104652043] [2024-10-11 17:57:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,164 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-11 17:57:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104652043] [2024-10-11 17:57:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104652043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157522386] [2024-10-11 17:57:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:04,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:04,168 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-11 17:57:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,318 INFO L93 Difference]: Finished difference Result 198 states and 267 transitions. [2024-10-11 17:57:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:04,319 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-11 17:57:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,320 INFO L225 Difference]: With dead ends: 198 [2024-10-11 17:57:04,320 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 17:57:04,321 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-11 17:57:04,322 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-11 17:57:04,322 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-11 17:57:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 17:57:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-10-11 17:57:04,340 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-11 17:57:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 267 transitions. [2024-10-11 17:57:04,342 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 267 transitions. Word has length 6 [2024-10-11 17:57:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,343 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 267 transitions. [2024-10-11 17:57:04,343 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-11 17:57:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 267 transitions. [2024-10-11 17:57:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:57:04,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:57:04,344 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-11 17:57:04,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1099452268, now seen corresponding path program 1 times [2024-10-11 17:57:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080676526] [2024-10-11 17:57:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,484 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-11 17:57:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080676526] [2024-10-11 17:57:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080676526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168680347] [2024-10-11 17:57:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:04,488 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-11 17:57:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,629 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-10-11 17:57:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:04,631 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-11 17:57:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,632 INFO L225 Difference]: With dead ends: 197 [2024-10-11 17:57:04,632 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 17:57:04,632 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-11 17:57:04,634 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-11 17:57:04,636 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-11 17:57:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 17:57:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-10-11 17:57:04,649 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-11 17:57:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2024-10-11 17:57:04,650 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 6 [2024-10-11 17:57:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,650 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2024-10-11 17:57:04,650 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-11 17:57:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2024-10-11 17:57:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:04,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:57:04,657 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-11 17:57:04,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 11661335, now seen corresponding path program 1 times [2024-10-11 17:57:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108630334] [2024-10-11 17:57:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,826 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-11 17:57:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108630334] [2024-10-11 17:57:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108630334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785658910] [2024-10-11 17:57:04,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:04,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:04,829 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-11 17:57:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,988 INFO L93 Difference]: Finished difference Result 343 states and 455 transitions. [2024-10-11 17:57:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:04,989 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-11 17:57:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,990 INFO L225 Difference]: With dead ends: 343 [2024-10-11 17:57:04,990 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 17:57:04,991 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-11 17:57:04,997 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:04,998 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.1s Time] [2024-10-11 17:57:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 17:57:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 252. [2024-10-11 17:57:05,013 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-11 17:57:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-10-11 17:57:05,016 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 8 [2024-10-11 17:57:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,017 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-10-11 17:57:05,017 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-11 17:57:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-10-11 17:57:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:05,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:57:05,019 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-11 17:57:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 11720917, now seen corresponding path program 1 times [2024-10-11 17:57:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742954130] [2024-10-11 17:57:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,128 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-11 17:57:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742954130] [2024-10-11 17:57:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742954130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99505146] [2024-10-11 17:57:05,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:05,132 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-11 17:57:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,279 INFO L93 Difference]: Finished difference Result 334 states and 445 transitions. [2024-10-11 17:57:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:05,279 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-11 17:57:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,281 INFO L225 Difference]: With dead ends: 334 [2024-10-11 17:57:05,281 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 17:57:05,281 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-11 17:57:05,282 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-11 17:57:05,282 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-11 17:57:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 17:57:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 252. [2024-10-11 17:57:05,289 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-11 17:57:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-10-11 17:57:05,290 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 8 [2024-10-11 17:57:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,290 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-10-11 17:57:05,291 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-11 17:57:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-10-11 17:57:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:57:05,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:57:05,292 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-11 17:57:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 361500123, now seen corresponding path program 1 times [2024-10-11 17:57:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961412978] [2024-10-11 17:57:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,310 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-11 17:57:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961412978] [2024-10-11 17:57:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961412978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:57:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758230398] [2024-10-11 17:57:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:05,312 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-11 17:57:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,422 INFO L93 Difference]: Finished difference Result 300 states and 405 transitions. [2024-10-11 17:57:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:05,423 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-11 17:57:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,426 INFO L225 Difference]: With dead ends: 300 [2024-10-11 17:57:05,426 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 17:57:05,426 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-11 17:57:05,427 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-11 17:57:05,427 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-11 17:57:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 17:57:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 249. [2024-10-11 17:57:05,437 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-11 17:57:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2024-10-11 17:57:05,439 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 9 [2024-10-11 17:57:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,440 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2024-10-11 17:57:05,440 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-11 17:57:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2024-10-11 17:57:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:57:05,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:57:05,441 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-11 17:57:05,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1143205964, now seen corresponding path program 1 times [2024-10-11 17:57:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657049549] [2024-10-11 17:57:05,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,529 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-11 17:57:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657049549] [2024-10-11 17:57:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657049549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765227655] [2024-10-11 17:57:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:05,532 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-11 17:57:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,725 INFO L93 Difference]: Finished difference Result 341 states and 427 transitions. [2024-10-11 17:57:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:05,725 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-11 17:57:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,727 INFO L225 Difference]: With dead ends: 341 [2024-10-11 17:57:05,727 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 17:57:05,727 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-11 17:57:05,728 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 146 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 17:57:05,728 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-11 17:57:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 17:57:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 255. [2024-10-11 17:57:05,734 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-11 17:57:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 362 transitions. [2024-10-11 17:57:05,735 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 362 transitions. Word has length 14 [2024-10-11 17:57:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,736 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 362 transitions. [2024-10-11 17:57:05,736 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-11 17:57:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 362 transitions. [2024-10-11 17:57:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:57:05,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:57:05,737 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-11 17:57:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1143205965, now seen corresponding path program 1 times [2024-10-11 17:57:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849794721] [2024-10-11 17:57:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,812 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-11 17:57:05,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849794721] [2024-10-11 17:57:05,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849794721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027196802] [2024-10-11 17:57:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:05,814 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-11 17:57:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,937 INFO L93 Difference]: Finished difference Result 254 states and 352 transitions. [2024-10-11 17:57:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:05,938 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-11 17:57:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,939 INFO L225 Difference]: With dead ends: 254 [2024-10-11 17:57:05,940 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 17:57:05,940 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-11 17:57:05,941 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-11 17:57:05,942 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-11 17:57:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 17:57:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-10-11 17:57:05,949 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-11 17:57:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 350 transitions. [2024-10-11 17:57:05,950 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 350 transitions. Word has length 14 [2024-10-11 17:57:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,951 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 350 transitions. [2024-10-11 17:57:05,951 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-11 17:57:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 350 transitions. [2024-10-11 17:57:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:05,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:57:05,953 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-11 17:57:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 427633431, now seen corresponding path program 1 times [2024-10-11 17:57:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730517267] [2024-10-11 17:57:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,109 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-11 17:57:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730517267] [2024-10-11 17:57:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730517267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544511404] [2024-10-11 17:57:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:06,112 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-11 17:57:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,380 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2024-10-11 17:57:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:06,381 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-11 17:57:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,383 INFO L225 Difference]: With dead ends: 349 [2024-10-11 17:57:06,383 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 17:57:06,383 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-11 17:57:06,384 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-11 17:57:06,384 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-11 17:57:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 17:57:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 249. [2024-10-11 17:57:06,390 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-11 17:57:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 344 transitions. [2024-10-11 17:57:06,391 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 344 transitions. Word has length 16 [2024-10-11 17:57:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 344 transitions. [2024-10-11 17:57:06,391 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-11 17:57:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 344 transitions. [2024-10-11 17:57:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:06,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:57:06,392 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-11 17:57:06,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 427633432, now seen corresponding path program 1 times [2024-10-11 17:57:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795564303] [2024-10-11 17:57:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,542 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-11 17:57:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795564303] [2024-10-11 17:57:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795564303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111653056] [2024-10-11 17:57:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:06,545 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-11 17:57:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,761 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2024-10-11 17:57:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:06,762 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-11 17:57:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,763 INFO L225 Difference]: With dead ends: 311 [2024-10-11 17:57:06,764 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 17:57:06,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:06,764 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-11 17:57:06,764 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-11 17:57:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 17:57:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2024-10-11 17:57:06,776 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-11 17:57:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 435 transitions. [2024-10-11 17:57:06,778 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 435 transitions. Word has length 16 [2024-10-11 17:57:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 435 transitions. [2024-10-11 17:57:06,778 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-11 17:57:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 435 transitions. [2024-10-11 17:57:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:06,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:57:06,779 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-11 17:57:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1379821031, now seen corresponding path program 1 times [2024-10-11 17:57:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127666624] [2024-10-11 17:57:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,844 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-11 17:57:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127666624] [2024-10-11 17:57:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127666624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050650333] [2024-10-11 17:57:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:06,846 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-11 17:57:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,916 INFO L93 Difference]: Finished difference Result 301 states and 433 transitions. [2024-10-11 17:57:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:06,916 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-11 17:57:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,918 INFO L225 Difference]: With dead ends: 301 [2024-10-11 17:57:06,918 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 17:57:06,918 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-11 17:57:06,919 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-11 17:57:06,919 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-11 17:57:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 17:57:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-11 17:57:06,925 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-11 17:57:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 433 transitions. [2024-10-11 17:57:06,926 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 433 transitions. Word has length 16 [2024-10-11 17:57:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,927 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 433 transitions. [2024-10-11 17:57:06,927 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-11 17:57:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 433 transitions. [2024-10-11 17:57:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:57:06,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:57:06,928 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-11 17:57:06,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 175276576, now seen corresponding path program 1 times [2024-10-11 17:57:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448304107] [2024-10-11 17:57:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,069 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-11 17:57:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448304107] [2024-10-11 17:57:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448304107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413769167] [2024-10-11 17:57:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:07,072 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-11 17:57:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,292 INFO L93 Difference]: Finished difference Result 342 states and 494 transitions. [2024-10-11 17:57:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:07,292 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-11 17:57:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,294 INFO L225 Difference]: With dead ends: 342 [2024-10-11 17:57:07,294 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 17:57:07,294 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-11 17:57:07,295 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-11 17:57:07,295 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-11 17:57:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 17:57:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 296. [2024-10-11 17:57:07,301 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-11 17:57:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 425 transitions. [2024-10-11 17:57:07,303 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 425 transitions. Word has length 17 [2024-10-11 17:57:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,303 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 425 transitions. [2024-10-11 17:57:07,303 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-11 17:57:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 425 transitions. [2024-10-11 17:57:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:57:07,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,304 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-11 17:57:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:57:07,304 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-11 17:57:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1129705676, now seen corresponding path program 1 times [2024-10-11 17:57:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034106838] [2024-10-11 17:57:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,494 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-11 17:57:07,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034106838] [2024-10-11 17:57:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034106838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990384547] [2024-10-11 17:57:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:07,496 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-11 17:57:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,731 INFO L93 Difference]: Finished difference Result 388 states and 531 transitions. [2024-10-11 17:57:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:07,732 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-11 17:57:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,734 INFO L225 Difference]: With dead ends: 388 [2024-10-11 17:57:07,734 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 17:57:07,734 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-11 17:57:07,734 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-11 17:57:07,735 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-11 17:57:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 17:57:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 290. [2024-10-11 17:57:07,743 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-11 17:57:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-10-11 17:57:07,746 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 18 [2024-10-11 17:57:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,746 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-10-11 17:57:07,747 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-11 17:57:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-10-11 17:57:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:07,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,747 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-11 17:57:07,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:57:07,748 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-11 17:57:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -660774663, now seen corresponding path program 1 times [2024-10-11 17:57:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56444586] [2024-10-11 17:57:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,794 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-11 17:57:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56444586] [2024-10-11 17:57:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56444586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494516122] [2024-10-11 17:57:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:07,797 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-11 17:57:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,942 INFO L93 Difference]: Finished difference Result 289 states and 411 transitions. [2024-10-11 17:57:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:07,943 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-11 17:57:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,945 INFO L225 Difference]: With dead ends: 289 [2024-10-11 17:57:07,946 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 17:57:07,946 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-11 17:57:07,947 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-11 17:57:07,947 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-11 17:57:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 17:57:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-11 17:57:07,953 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-11 17:57:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 405 transitions. [2024-10-11 17:57:07,955 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 405 transitions. Word has length 19 [2024-10-11 17:57:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 405 transitions. [2024-10-11 17:57:07,955 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-11 17:57:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 405 transitions. [2024-10-11 17:57:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:07,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,956 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-11 17:57:07,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:57:07,956 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-11 17:57:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash -660774662, now seen corresponding path program 1 times [2024-10-11 17:57:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230332935] [2024-10-11 17:57:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,105 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-11 17:57:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230332935] [2024-10-11 17:57:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230332935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547443111] [2024-10-11 17:57:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:08,109 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-11 17:57:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,255 INFO L93 Difference]: Finished difference Result 288 states and 400 transitions. [2024-10-11 17:57:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:08,256 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-11 17:57:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,257 INFO L225 Difference]: With dead ends: 288 [2024-10-11 17:57:08,258 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 17:57:08,259 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-11 17:57:08,259 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-11 17:57:08,259 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-11 17:57:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 17:57:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 249. [2024-10-11 17:57:08,265 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-11 17:57:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 349 transitions. [2024-10-11 17:57:08,267 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 349 transitions. Word has length 19 [2024-10-11 17:57:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 349 transitions. [2024-10-11 17:57:08,267 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-11 17:57:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 349 transitions. [2024-10-11 17:57:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:08,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,268 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-11 17:57:08,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:57:08,268 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-11 17:57:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 762169515, now seen corresponding path program 1 times [2024-10-11 17:57:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123740944] [2024-10-11 17:57:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,487 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-11 17:57:08,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123740944] [2024-10-11 17:57:08,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123740944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:08,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871865390] [2024-10-11 17:57:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:08,489 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-11 17:57:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,689 INFO L93 Difference]: Finished difference Result 300 states and 415 transitions. [2024-10-11 17:57:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:08,689 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-11 17:57:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,690 INFO L225 Difference]: With dead ends: 300 [2024-10-11 17:57:08,690 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 17:57:08,691 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-11 17:57:08,691 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-11 17:57:08,691 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-11 17:57:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 17:57:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2024-10-11 17:57:08,696 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-11 17:57:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 359 transitions. [2024-10-11 17:57:08,697 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 359 transitions. Word has length 19 [2024-10-11 17:57:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 359 transitions. [2024-10-11 17:57:08,697 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-11 17:57:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 359 transitions. [2024-10-11 17:57:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,698 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-11 17:57:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:57:08,698 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-11 17:57:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1008159581, now seen corresponding path program 1 times [2024-10-11 17:57:08,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334889629] [2024-10-11 17:57:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334889629] [2024-10-11 17:57:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334889629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317366368] [2024-10-11 17:57:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:08,836 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-11 17:57:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,048 INFO L93 Difference]: Finished difference Result 303 states and 415 transitions. [2024-10-11 17:57:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:09,048 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-11 17:57:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,050 INFO L225 Difference]: With dead ends: 303 [2024-10-11 17:57:09,050 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 17:57:09,050 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-11 17:57:09,051 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-11 17:57:09,051 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-11 17:57:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 17:57:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2024-10-11 17:57:09,056 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-11 17:57:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 363 transitions. [2024-10-11 17:57:09,057 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 363 transitions. Word has length 20 [2024-10-11 17:57:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,057 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 363 transitions. [2024-10-11 17:57:09,057 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-11 17:57:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 363 transitions. [2024-10-11 17:57:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:09,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,058 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-11 17:57:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:57:09,059 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-11 17:57:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1432820251, now seen corresponding path program 1 times [2024-10-11 17:57:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352836335] [2024-10-11 17:57:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,096 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-11 17:57:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352836335] [2024-10-11 17:57:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352836335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226890534] [2024-10-11 17:57:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:09,098 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-11 17:57:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,142 INFO L93 Difference]: Finished difference Result 273 states and 375 transitions. [2024-10-11 17:57:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:09,143 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-11 17:57:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,144 INFO L225 Difference]: With dead ends: 273 [2024-10-11 17:57:09,144 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 17:57:09,144 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-11 17:57:09,145 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-11 17:57:09,145 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-11 17:57:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 17:57:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-11 17:57:09,150 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-11 17:57:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 375 transitions. [2024-10-11 17:57:09,152 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 375 transitions. Word has length 22 [2024-10-11 17:57:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,152 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 375 transitions. [2024-10-11 17:57:09,152 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-11 17:57:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 375 transitions. [2024-10-11 17:57:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:09,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,153 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-11 17:57:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:57:09,153 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-11 17:57:09,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1432760669, now seen corresponding path program 1 times [2024-10-11 17:57:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295594112] [2024-10-11 17:57:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,227 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-11 17:57:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295594112] [2024-10-11 17:57:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295594112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877899146] [2024-10-11 17:57:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:09,229 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-11 17:57:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,320 INFO L93 Difference]: Finished difference Result 336 states and 467 transitions. [2024-10-11 17:57:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:09,320 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-11 17:57:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,322 INFO L225 Difference]: With dead ends: 336 [2024-10-11 17:57:09,322 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 17:57:09,322 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-11 17:57:09,322 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-11 17:57:09,322 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-11 17:57:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 17:57:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 330. [2024-10-11 17:57:09,328 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-11 17:57:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 467 transitions. [2024-10-11 17:57:09,329 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 467 transitions. Word has length 22 [2024-10-11 17:57:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,329 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 467 transitions. [2024-10-11 17:57:09,329 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-11 17:57:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 467 transitions. [2024-10-11 17:57:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:09,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,330 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-11 17:57:09,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:57:09,331 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-11 17:57:09,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1432760670, now seen corresponding path program 1 times [2024-10-11 17:57:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610835035] [2024-10-11 17:57:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,361 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-11 17:57:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610835035] [2024-10-11 17:57:09,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610835035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731834148] [2024-10-11 17:57:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:09,364 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-11 17:57:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,431 INFO L93 Difference]: Finished difference Result 328 states and 455 transitions. [2024-10-11 17:57:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:09,431 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-11 17:57:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,433 INFO L225 Difference]: With dead ends: 328 [2024-10-11 17:57:09,433 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 17:57:09,433 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-11 17:57:09,433 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-11 17:57:09,433 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-11 17:57:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 17:57:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-11 17:57:09,439 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-11 17:57:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 455 transitions. [2024-10-11 17:57:09,440 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 455 transitions. Word has length 22 [2024-10-11 17:57:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,440 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 455 transitions. [2024-10-11 17:57:09,440 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-11 17:57:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 455 transitions. [2024-10-11 17:57:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:09,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:09,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:57:09,441 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-11 17:57:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1402069452, now seen corresponding path program 1 times [2024-10-11 17:57:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140216210] [2024-10-11 17:57:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,504 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-11 17:57:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140216210] [2024-10-11 17:57:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140216210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573102011] [2024-10-11 17:57:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:09,506 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-11 17:57:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,576 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-10-11 17:57:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:09,577 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-11 17:57:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,578 INFO L225 Difference]: With dead ends: 365 [2024-10-11 17:57:09,578 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 17:57:09,579 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-11 17:57:09,579 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-11 17:57:09,579 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-11 17:57:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 17:57:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 328. [2024-10-11 17:57:09,588 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-11 17:57:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 452 transitions. [2024-10-11 17:57:09,589 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 452 transitions. Word has length 23 [2024-10-11 17:57:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 452 transitions. [2024-10-11 17:57:09,590 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-11 17:57:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2024-10-11 17:57:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:09,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,591 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-11 17:57:09,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:57:09,591 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-11 17:57:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 891535275, now seen corresponding path program 1 times [2024-10-11 17:57:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129316030] [2024-10-11 17:57:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129316030] [2024-10-11 17:57:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129316030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816066882] [2024-10-11 17:57:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:09,655 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-11 17:57:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,750 INFO L93 Difference]: Finished difference Result 391 states and 540 transitions. [2024-10-11 17:57:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:09,750 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-11 17:57:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,751 INFO L225 Difference]: With dead ends: 391 [2024-10-11 17:57:09,751 INFO L226 Difference]: Without dead ends: 391 [2024-10-11 17:57:09,752 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-11 17:57:09,752 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-11 17:57:09,752 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-11 17:57:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-11 17:57:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 328. [2024-10-11 17:57:09,758 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-11 17:57:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 452 transitions. [2024-10-11 17:57:09,759 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 452 transitions. Word has length 23 [2024-10-11 17:57:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,760 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 452 transitions. [2024-10-11 17:57:09,760 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-11 17:57:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2024-10-11 17:57:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:09,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,760 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-11 17:57:09,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:57:09,760 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-11 17:57:09,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1571593645, now seen corresponding path program 1 times [2024-10-11 17:57:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772665528] [2024-10-11 17:57:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,818 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-11 17:57:09,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772665528] [2024-10-11 17:57:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772665528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904978422] [2024-10-11 17:57:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:09,820 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-11 17:57:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,884 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2024-10-11 17:57:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:09,884 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-11 17:57:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,885 INFO L225 Difference]: With dead ends: 270 [2024-10-11 17:57:09,885 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 17:57:09,886 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-11 17:57:09,886 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-11 17:57:09,886 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-11 17:57:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 17:57:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-11 17:57:09,891 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-11 17:57:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2024-10-11 17:57:09,892 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 23 [2024-10-11 17:57:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2024-10-11 17:57:09,892 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-11 17:57:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2024-10-11 17:57:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:57:09,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,893 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-11 17:57:09,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:57:09,893 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-11 17:57:09,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1801500355, now seen corresponding path program 1 times [2024-10-11 17:57:09,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097079709] [2024-10-11 17:57:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,965 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-11 17:57:09,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097079709] [2024-10-11 17:57:09,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097079709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452394304] [2024-10-11 17:57:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:09,966 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-11 17:57:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,064 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2024-10-11 17:57:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:10,064 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-11 17:57:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,066 INFO L225 Difference]: With dead ends: 300 [2024-10-11 17:57:10,066 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 17:57:10,066 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-11 17:57:10,067 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-11 17:57:10,067 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-11 17:57:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 17:57:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-11 17:57:10,075 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-11 17:57:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 387 transitions. [2024-10-11 17:57:10,076 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 387 transitions. Word has length 24 [2024-10-11 17:57:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,076 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 387 transitions. [2024-10-11 17:57:10,077 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-11 17:57:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 387 transitions. [2024-10-11 17:57:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:57:10,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,077 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-11 17:57:10,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:57:10,077 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-11 17:57:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1801500549, now seen corresponding path program 1 times [2024-10-11 17:57:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161464794] [2024-10-11 17:57:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,166 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-11 17:57:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161464794] [2024-10-11 17:57:10,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161464794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939395756] [2024-10-11 17:57:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:10,170 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-11 17:57:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,266 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2024-10-11 17:57:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:10,267 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-11 17:57:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,268 INFO L225 Difference]: With dead ends: 408 [2024-10-11 17:57:10,268 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 17:57:10,268 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-11 17:57:10,269 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-11 17:57:10,269 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-11 17:57:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 17:57:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 383. [2024-10-11 17:57:10,277 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-11 17:57:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 521 transitions. [2024-10-11 17:57:10,278 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 521 transitions. Word has length 24 [2024-10-11 17:57:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,278 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 521 transitions. [2024-10-11 17:57:10,278 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-11 17:57:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 521 transitions. [2024-10-11 17:57:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:57:10,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,278 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-11 17:57:10,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:57:10,279 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-11 17:57:10,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2066908813, now seen corresponding path program 1 times [2024-10-11 17:57:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896650789] [2024-10-11 17:57:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,375 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-11 17:57:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896650789] [2024-10-11 17:57:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896650789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151761231] [2024-10-11 17:57:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:10,383 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-11 17:57:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,507 INFO L93 Difference]: Finished difference Result 408 states and 543 transitions. [2024-10-11 17:57:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:10,509 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-11 17:57:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,511 INFO L225 Difference]: With dead ends: 408 [2024-10-11 17:57:10,511 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 17:57:10,511 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-11 17:57:10,511 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-11 17:57:10,512 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-11 17:57:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 17:57:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 293. [2024-10-11 17:57:10,517 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-11 17:57:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 379 transitions. [2024-10-11 17:57:10,518 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 379 transitions. Word has length 25 [2024-10-11 17:57:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 379 transitions. [2024-10-11 17:57:10,518 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-11 17:57:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 379 transitions. [2024-10-11 17:57:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 17:57:10,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,519 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-11 17:57:10,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:57:10,519 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-11 17:57:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1402781752, now seen corresponding path program 1 times [2024-10-11 17:57:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991717038] [2024-10-11 17:57:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991717038] [2024-10-11 17:57:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991717038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740122206] [2024-10-11 17:57:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:10,641 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-11 17:57:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,738 INFO L93 Difference]: Finished difference Result 294 states and 379 transitions. [2024-10-11 17:57:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:10,738 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-11 17:57:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,739 INFO L225 Difference]: With dead ends: 294 [2024-10-11 17:57:10,739 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 17:57:10,740 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-11 17:57:10,741 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-11 17:57:10,741 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-11 17:57:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 17:57:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2024-10-11 17:57:10,746 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-11 17:57:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 377 transitions. [2024-10-11 17:57:10,747 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 377 transitions. Word has length 27 [2024-10-11 17:57:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 377 transitions. [2024-10-11 17:57:10,747 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-11 17:57:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 377 transitions. [2024-10-11 17:57:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 17:57:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,748 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-11 17:57:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:57:10,749 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-11 17:57:10,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1402781753, now seen corresponding path program 1 times [2024-10-11 17:57:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634594567] [2024-10-11 17:57:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,795 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-11 17:57:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634594567] [2024-10-11 17:57:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634594567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799836892] [2024-10-11 17:57:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:10,797 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-11 17:57:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,895 INFO L93 Difference]: Finished difference Result 293 states and 377 transitions. [2024-10-11 17:57:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:10,896 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-11 17:57:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,897 INFO L225 Difference]: With dead ends: 293 [2024-10-11 17:57:10,897 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 17:57:10,900 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-11 17:57:10,900 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-11 17:57:10,900 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-11 17:57:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 17:57:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-10-11 17:57:10,908 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-11 17:57:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 375 transitions. [2024-10-11 17:57:10,909 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 375 transitions. Word has length 27 [2024-10-11 17:57:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,909 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 375 transitions. [2024-10-11 17:57:10,909 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-11 17:57:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 375 transitions. [2024-10-11 17:57:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:57:10,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,910 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-11 17:57:10,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:57:10,910 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-11 17:57:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash 546469544, now seen corresponding path program 1 times [2024-10-11 17:57:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422947839] [2024-10-11 17:57:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,980 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-11 17:57:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422947839] [2024-10-11 17:57:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422947839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231811941] [2024-10-11 17:57:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:10,983 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-11 17:57:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:11,112 INFO L93 Difference]: Finished difference Result 297 states and 371 transitions. [2024-10-11 17:57:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:11,112 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-11 17:57:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:11,113 INFO L225 Difference]: With dead ends: 297 [2024-10-11 17:57:11,113 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 17:57:11,114 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-11 17:57:11,114 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-11 17:57:11,115 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-11 17:57:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 17:57:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 288. [2024-10-11 17:57:11,122 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-11 17:57:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 369 transitions. [2024-10-11 17:57:11,123 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 369 transitions. Word has length 29 [2024-10-11 17:57:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 369 transitions. [2024-10-11 17:57:11,123 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-11 17:57:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 369 transitions. [2024-10-11 17:57:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:57:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:11,124 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-11 17:57:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:57:11,124 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-11 17:57:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 546469545, now seen corresponding path program 1 times [2024-10-11 17:57:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:11,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85601354] [2024-10-11 17:57:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:11,299 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-11 17:57:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85601354] [2024-10-11 17:57:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85601354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455796047] [2024-10-11 17:57:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:11,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:11,302 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-11 17:57:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:11,552 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2024-10-11 17:57:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:11,552 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-11 17:57:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:11,553 INFO L225 Difference]: With dead ends: 425 [2024-10-11 17:57:11,553 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 17:57:11,554 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-11 17:57:11,554 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-11 17:57:11,554 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-11 17:57:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 17:57:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 399. [2024-10-11 17:57:11,563 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-11 17:57:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 541 transitions. [2024-10-11 17:57:11,565 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 541 transitions. Word has length 29 [2024-10-11 17:57:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:11,565 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 541 transitions. [2024-10-11 17:57:11,565 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-11 17:57:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 541 transitions. [2024-10-11 17:57:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:57:11,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:11,565 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-11 17:57:11,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:57:11,567 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-11 17:57:11,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash 546469706, now seen corresponding path program 1 times [2024-10-11 17:57:11,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110077353] [2024-10-11 17:57:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:11,731 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-11 17:57:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110077353] [2024-10-11 17:57:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110077353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540869639] [2024-10-11 17:57:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:11,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:11,732 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-11 17:57:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:11,982 INFO L93 Difference]: Finished difference Result 458 states and 586 transitions. [2024-10-11 17:57:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:11,982 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-11 17:57:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:11,984 INFO L225 Difference]: With dead ends: 458 [2024-10-11 17:57:11,984 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 17:57:11,984 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-11 17:57:11,984 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-11 17:57:11,985 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-11 17:57:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 17:57:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 342. [2024-10-11 17:57:11,991 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-11 17:57:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 451 transitions. [2024-10-11 17:57:11,992 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 451 transitions. Word has length 29 [2024-10-11 17:57:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:11,992 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 451 transitions. [2024-10-11 17:57:11,992 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-11 17:57:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 451 transitions. [2024-10-11 17:57:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:57:11,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:11,993 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-11 17:57:11,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:57:11,993 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-11 17:57:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -977755367, now seen corresponding path program 1 times [2024-10-11 17:57:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696938039] [2024-10-11 17:57:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,587 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-11 17:57:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696938039] [2024-10-11 17:57:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696938039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444960389] [2024-10-11 17:57:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:12,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:12,589 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-11 17:57:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:13,106 INFO L93 Difference]: Finished difference Result 365 states and 475 transitions. [2024-10-11 17:57:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:13,106 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-11 17:57:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:13,109 INFO L225 Difference]: With dead ends: 365 [2024-10-11 17:57:13,109 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 17:57:13,109 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-11 17:57:13,110 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-11 17:57:13,110 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-11 17:57:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 17:57:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2024-10-11 17:57:13,116 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-11 17:57:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 469 transitions. [2024-10-11 17:57:13,118 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 469 transitions. Word has length 42 [2024-10-11 17:57:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:13,119 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 469 transitions. [2024-10-11 17:57:13,119 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-11 17:57:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 469 transitions. [2024-10-11 17:57:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:57:13,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:13,119 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-11 17:57:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:57:13,120 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-11 17:57:13,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1208703882, now seen corresponding path program 1 times [2024-10-11 17:57:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:13,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064891310] [2024-10-11 17:57:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:13,593 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-11 17:57:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064891310] [2024-10-11 17:57:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064891310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:13,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:13,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767334099] [2024-10-11 17:57:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:13,595 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-11 17:57:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,017 INFO L93 Difference]: Finished difference Result 457 states and 556 transitions. [2024-10-11 17:57:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:14,018 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-11 17:57:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,019 INFO L225 Difference]: With dead ends: 457 [2024-10-11 17:57:14,019 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 17:57:14,020 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-11 17:57:14,020 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-11 17:57:14,020 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-11 17:57:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 17:57:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 382. [2024-10-11 17:57:14,027 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-11 17:57:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 497 transitions. [2024-10-11 17:57:14,028 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 497 transitions. Word has length 43 [2024-10-11 17:57:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,028 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 497 transitions. [2024-10-11 17:57:14,029 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-11 17:57:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 497 transitions. [2024-10-11 17:57:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:57:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,030 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-11 17:57:14,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:57:14,030 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-11 17:57:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 363315233, now seen corresponding path program 1 times [2024-10-11 17:57:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071122123] [2024-10-11 17:57:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,761 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-11 17:57:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071122123] [2024-10-11 17:57:14,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071122123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 17:57:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540405460] [2024-10-11 17:57:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:14,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:57:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:14,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:57:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:57:14,763 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-11 17:57:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:15,492 INFO L93 Difference]: Finished difference Result 456 states and 558 transitions. [2024-10-11 17:57:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:15,493 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-11 17:57:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:15,494 INFO L225 Difference]: With dead ends: 456 [2024-10-11 17:57:15,494 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 17:57:15,495 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-11 17:57:15,495 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-11 17:57:15,495 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-11 17:57:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 17:57:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 377. [2024-10-11 17:57:15,502 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-11 17:57:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 495 transitions. [2024-10-11 17:57:15,504 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 495 transitions. Word has length 43 [2024-10-11 17:57:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:15,504 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 495 transitions. [2024-10-11 17:57:15,504 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-11 17:57:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 495 transitions. [2024-10-11 17:57:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:15,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:15,506 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-11 17:57:15,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:57:15,506 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-11 17:57:15,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash -156608335, now seen corresponding path program 1 times [2024-10-11 17:57:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898957803] [2024-10-11 17:57:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:16,130 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-11 17:57:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898957803] [2024-10-11 17:57:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898957803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:16,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:57:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29935728] [2024-10-11 17:57:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:16,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:57:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:57:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:16,134 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-11 17:57:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:16,802 INFO L93 Difference]: Finished difference Result 657 states and 846 transitions. [2024-10-11 17:57:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:16,802 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-11 17:57:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:16,804 INFO L225 Difference]: With dead ends: 657 [2024-10-11 17:57:16,804 INFO L226 Difference]: Without dead ends: 657 [2024-10-11 17:57:16,805 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-11 17:57:16,805 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-11 17:57:16,805 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-11 17:57:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-11 17:57:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 453. [2024-10-11 17:57:16,814 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-11 17:57:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 601 transitions. [2024-10-11 17:57:16,815 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 601 transitions. Word has length 44 [2024-10-11 17:57:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:16,815 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 601 transitions. [2024-10-11 17:57:16,815 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-11 17:57:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 601 transitions. [2024-10-11 17:57:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:16,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:16,816 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-11 17:57:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:57:16,816 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-11 17:57:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash -156608334, now seen corresponding path program 1 times [2024-10-11 17:57:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095502821] [2024-10-11 17:57:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:17,622 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-11 17:57:17,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:17,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095502821] [2024-10-11 17:57:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095502821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:57:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078657826] [2024-10-11 17:57:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:17,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:57:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:17,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:57:17,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:57:17,625 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-11 17:57:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:18,350 INFO L93 Difference]: Finished difference Result 719 states and 932 transitions. [2024-10-11 17:57:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:18,351 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-11 17:57:18,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:18,353 INFO L225 Difference]: With dead ends: 719 [2024-10-11 17:57:18,353 INFO L226 Difference]: Without dead ends: 719 [2024-10-11 17:57:18,355 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-11 17:57:18,356 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:18,356 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.5s Time] [2024-10-11 17:57:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-11 17:57:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 528. [2024-10-11 17:57:18,370 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-11 17:57:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 715 transitions. [2024-10-11 17:57:18,372 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 715 transitions. Word has length 44 [2024-10-11 17:57:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:18,372 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 715 transitions. [2024-10-11 17:57:18,372 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-11 17:57:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 715 transitions. [2024-10-11 17:57:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:18,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:18,373 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-11 17:57:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:57:18,374 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-11 17:57:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash -156548753, now seen corresponding path program 1 times [2024-10-11 17:57:18,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103528741] [2024-10-11 17:57:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:19,270 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-11 17:57:19,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103528741] [2024-10-11 17:57:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103528741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117205316] [2024-10-11 17:57:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:19,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:19,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:57:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:19,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 17:57:19,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:19,765 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-11 17:57:19,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:19,992 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-11 17:57:19,998 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-11 17:57:19,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117205316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:19,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-10-11 17:57:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445665622] [2024-10-11 17:57:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:20,001 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-11 17:57:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:20,397 INFO L93 Difference]: Finished difference Result 837 states and 1126 transitions. [2024-10-11 17:57:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:20,397 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-11 17:57:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:20,399 INFO L225 Difference]: With dead ends: 837 [2024-10-11 17:57:20,399 INFO L226 Difference]: Without dead ends: 837 [2024-10-11 17:57:20,400 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-11 17:57:20,400 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-11 17:57:20,400 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-11 17:57:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-11 17:57:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 634. [2024-10-11 17:57:20,416 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-11 17:57:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 866 transitions. [2024-10-11 17:57:20,418 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 866 transitions. Word has length 44 [2024-10-11 17:57:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:20,419 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 866 transitions. [2024-10-11 17:57:20,419 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-11 17:57:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 866 transitions. [2024-10-11 17:57:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:20,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:20,420 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-11 17:57:20,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:57:20,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 17:57:20,621 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-11 17:57:20,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash -156548752, now seen corresponding path program 1 times [2024-10-11 17:57:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:20,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607755194] [2024-10-11 17:57:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,789 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-11 17:57:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607755194] [2024-10-11 17:57:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607755194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050402724] [2024-10-11 17:57:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:21,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:21,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:57:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 17:57:21,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:21,993 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-11 17:57:22,268 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-11 17:57:22,271 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-11 17:57:22,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:22,490 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-11 17:57:22,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:22,495 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-11 17:57:22,529 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-11 17:57:22,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050402724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 22 [2024-10-11 17:57:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906763448] [2024-10-11 17:57:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:22,531 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-11 17:57:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:23,000 INFO L93 Difference]: Finished difference Result 905 states and 1228 transitions. [2024-10-11 17:57:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:23,000 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-11 17:57:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:23,003 INFO L225 Difference]: With dead ends: 905 [2024-10-11 17:57:23,003 INFO L226 Difference]: Without dead ends: 905 [2024-10-11 17:57:23,004 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-11 17:57:23,004 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 308 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-11 17:57:23,005 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-11 17:57:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-11 17:57:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 708. [2024-10-11 17:57:23,021 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-11 17:57:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2024-10-11 17:57:23,023 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 44 [2024-10-11 17:57:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:23,024 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2024-10-11 17:57:23,024 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-11 17:57:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2024-10-11 17:57:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:23,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:23,025 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-11 17:57:23,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:57:23,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-11 17:57:23,226 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-11 17:57:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 866287478, now seen corresponding path program 1 times [2024-10-11 17:57:23,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961772737] [2024-10-11 17:57:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,447 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-11 17:57:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:23,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961772737] [2024-10-11 17:57:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961772737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47389327] [2024-10-11 17:57:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:23,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:23,450 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-11 17:57:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:23,742 INFO L93 Difference]: Finished difference Result 983 states and 1353 transitions. [2024-10-11 17:57:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:23,742 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-11 17:57:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:23,745 INFO L225 Difference]: With dead ends: 983 [2024-10-11 17:57:23,746 INFO L226 Difference]: Without dead ends: 983 [2024-10-11 17:57:23,746 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-11 17:57:23,746 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:23,747 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.3s Time] [2024-10-11 17:57:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-10-11 17:57:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 760. [2024-10-11 17:57:23,763 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-11 17:57:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1059 transitions. [2024-10-11 17:57:23,766 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1059 transitions. Word has length 44 [2024-10-11 17:57:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:23,766 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1059 transitions. [2024-10-11 17:57:23,766 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-11 17:57:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1059 transitions. [2024-10-11 17:57:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:23,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:23,769 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-11 17:57:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 17:57:23,770 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-11 17:57:23,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 866287479, now seen corresponding path program 1 times [2024-10-11 17:57:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510823274] [2024-10-11 17:57:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,131 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-11 17:57:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510823274] [2024-10-11 17:57:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510823274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840430021] [2024-10-11 17:57:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:24,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:24,133 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-11 17:57:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:24,423 INFO L93 Difference]: Finished difference Result 1035 states and 1426 transitions. [2024-10-11 17:57:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:24,424 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-11 17:57:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:24,427 INFO L225 Difference]: With dead ends: 1035 [2024-10-11 17:57:24,427 INFO L226 Difference]: Without dead ends: 1035 [2024-10-11 17:57:24,428 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-11 17:57:24,428 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:24,428 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.2s Time] [2024-10-11 17:57:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-10-11 17:57:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 602. [2024-10-11 17:57:24,439 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-11 17:57:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 832 transitions. [2024-10-11 17:57:24,441 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 832 transitions. Word has length 44 [2024-10-11 17:57:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:24,441 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 832 transitions. [2024-10-11 17:57:24,441 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-11 17:57:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 832 transitions. [2024-10-11 17:57:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:24,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:24,442 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-11 17:57:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 17:57:24,442 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-11 17:57:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 866347060, now seen corresponding path program 1 times [2024-10-11 17:57:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351663355] [2024-10-11 17:57:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,802 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-11 17:57:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351663355] [2024-10-11 17:57:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351663355] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11865856] [2024-10-11 17:57:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:24,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:24,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:57:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 17:57:24,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:25,204 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-11 17:57:25,311 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-11 17:57:25,476 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-11 17:57:25,480 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-11 17:57:25,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11865856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-10-11 17:57:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5093623] [2024-10-11 17:57:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:25,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:57:25,483 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-11 17:57:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:26,016 INFO L93 Difference]: Finished difference Result 941 states and 1269 transitions. [2024-10-11 17:57:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:26,017 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-11 17:57:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:26,020 INFO L225 Difference]: With dead ends: 941 [2024-10-11 17:57:26,020 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 17:57:26,020 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-11 17:57:26,021 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-11 17:57:26,021 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-11 17:57:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 17:57:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 675. [2024-10-11 17:57:26,033 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-11 17:57:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 933 transitions. [2024-10-11 17:57:26,035 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 933 transitions. Word has length 44 [2024-10-11 17:57:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:26,035 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 933 transitions. [2024-10-11 17:57:26,035 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-11 17:57:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 933 transitions. [2024-10-11 17:57:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:26,036 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-11 17:57:26,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:57:26,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:26,239 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-11 17:57:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 866347061, now seen corresponding path program 1 times [2024-10-11 17:57:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900225504] [2024-10-11 17:57:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:26,698 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-11 17:57:26,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:26,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900225504] [2024-10-11 17:57:26,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900225504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:26,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926119770] [2024-10-11 17:57:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:26,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:26,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:26,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:26,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:57:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:26,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 17:57:26,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:26,939 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-11 17:57:27,247 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-11 17:57:27,255 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-11 17:57:27,328 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-11 17:57:27,338 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-11 17:57:27,508 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-11 17:57:27,550 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-11 17:57:27,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:27,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926119770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-11 17:57:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782039763] [2024-10-11 17:57:27,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:27,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:57:27,552 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-11 17:57:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:28,213 INFO L93 Difference]: Finished difference Result 921 states and 1240 transitions. [2024-10-11 17:57:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:28,214 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-11 17:57:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:28,217 INFO L225 Difference]: With dead ends: 921 [2024-10-11 17:57:28,217 INFO L226 Difference]: Without dead ends: 921 [2024-10-11 17:57:28,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:57:28,218 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 250 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-11 17:57:28,218 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-11 17:57:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-11 17:57:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 623. [2024-10-11 17:57:28,229 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-11 17:57:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 859 transitions. [2024-10-11 17:57:28,231 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 859 transitions. Word has length 44 [2024-10-11 17:57:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:28,231 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 859 transitions. [2024-10-11 17:57:28,231 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-11 17:57:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 859 transitions. [2024-10-11 17:57:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:28,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:28,232 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-11 17:57:28,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:57:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-10-11 17:57:28,433 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-11 17:57:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -559892351, now seen corresponding path program 1 times [2024-10-11 17:57:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293826146] [2024-10-11 17:57:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,884 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-11 17:57:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:28,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293826146] [2024-10-11 17:57:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293826146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:28,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:57:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687834233] [2024-10-11 17:57:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:28,886 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-11 17:57:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,293 INFO L93 Difference]: Finished difference Result 1012 states and 1373 transitions. [2024-10-11 17:57:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:29,293 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-11 17:57:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,296 INFO L225 Difference]: With dead ends: 1012 [2024-10-11 17:57:29,297 INFO L226 Difference]: Without dead ends: 1012 [2024-10-11 17:57:29,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:29,298 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-11 17:57:29,298 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-11 17:57:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-11 17:57:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 810. [2024-10-11 17:57:29,311 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-11 17:57:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1138 transitions. [2024-10-11 17:57:29,313 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1138 transitions. Word has length 45 [2024-10-11 17:57:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,313 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1138 transitions. [2024-10-11 17:57:29,314 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-11 17:57:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1138 transitions. [2024-10-11 17:57:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:29,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,315 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-11 17:57:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 17:57:29,315 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-11 17:57:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -558045309, now seen corresponding path program 1 times [2024-10-11 17:57:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387905085] [2024-10-11 17:57:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,472 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-11 17:57:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387905085] [2024-10-11 17:57:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387905085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662085765] [2024-10-11 17:57:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:29,475 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-11 17:57:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,672 INFO L93 Difference]: Finished difference Result 1230 states and 1717 transitions. [2024-10-11 17:57:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:29,672 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-11 17:57:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,676 INFO L225 Difference]: With dead ends: 1230 [2024-10-11 17:57:29,676 INFO L226 Difference]: Without dead ends: 1230 [2024-10-11 17:57:29,676 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-11 17:57:29,676 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-11 17:57:29,676 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-11 17:57:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-10-11 17:57:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1028. [2024-10-11 17:57:29,695 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-11 17:57:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1466 transitions. [2024-10-11 17:57:29,697 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1466 transitions. Word has length 45 [2024-10-11 17:57:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1466 transitions. [2024-10-11 17:57:29,697 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-11 17:57:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1466 transitions. [2024-10-11 17:57:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:29,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,698 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-11 17:57:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 17:57:29,699 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-11 17:57:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1085106780, now seen corresponding path program 1 times [2024-10-11 17:57:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419896845] [2024-10-11 17:57:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,904 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-11 17:57:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419896845] [2024-10-11 17:57:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419896845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:57:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753689209] [2024-10-11 17:57:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:29,906 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-11 17:57:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,179 INFO L93 Difference]: Finished difference Result 1263 states and 1767 transitions. [2024-10-11 17:57:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:30,180 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-11 17:57:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,185 INFO L225 Difference]: With dead ends: 1263 [2024-10-11 17:57:30,185 INFO L226 Difference]: Without dead ends: 1263 [2024-10-11 17:57:30,185 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-11 17:57:30,186 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-11 17:57:30,186 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-11 17:57:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-11 17:57:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 846. [2024-10-11 17:57:30,203 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-11 17:57:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1194 transitions. [2024-10-11 17:57:30,205 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1194 transitions. Word has length 45 [2024-10-11 17:57:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1194 transitions. [2024-10-11 17:57:30,206 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-11 17:57:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1194 transitions. [2024-10-11 17:57:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:30,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,207 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-11 17:57:30,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 17:57:30,207 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-11 17:57:30,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1086953822, now seen corresponding path program 1 times [2024-10-11 17:57:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571992056] [2024-10-11 17:57:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,365 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-11 17:57:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571992056] [2024-10-11 17:57:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571992056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349568330] [2024-10-11 17:57:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:30,372 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-11 17:57:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,671 INFO L93 Difference]: Finished difference Result 1072 states and 1482 transitions. [2024-10-11 17:57:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:57:30,672 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-11 17:57:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,675 INFO L225 Difference]: With dead ends: 1072 [2024-10-11 17:57:30,676 INFO L226 Difference]: Without dead ends: 1072 [2024-10-11 17:57:30,676 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-11 17:57:30,676 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,677 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.3s Time] [2024-10-11 17:57:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-11 17:57:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 665. [2024-10-11 17:57:30,690 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-11 17:57:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 924 transitions. [2024-10-11 17:57:30,691 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 924 transitions. Word has length 45 [2024-10-11 17:57:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,692 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 924 transitions. [2024-10-11 17:57:30,692 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-11 17:57:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 924 transitions. [2024-10-11 17:57:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:30,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,693 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-11 17:57:30,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 17:57:30,693 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-11 17:57:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -176716848, now seen corresponding path program 1 times [2024-10-11 17:57:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647104581] [2024-10-11 17:57:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,171 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-11 17:57:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647104581] [2024-10-11 17:57:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647104581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760442479] [2024-10-11 17:57:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:31,173 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-11 17:57:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:31,570 INFO L93 Difference]: Finished difference Result 1054 states and 1435 transitions. [2024-10-11 17:57:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:31,571 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-11 17:57:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:31,575 INFO L225 Difference]: With dead ends: 1054 [2024-10-11 17:57:31,575 INFO L226 Difference]: Without dead ends: 1054 [2024-10-11 17:57:31,576 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-11 17:57:31,577 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 464 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 17:57:31,579 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-11 17:57:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-11 17:57:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 856. [2024-10-11 17:57:31,596 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-11 17:57:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1208 transitions. [2024-10-11 17:57:31,598 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1208 transitions. Word has length 46 [2024-10-11 17:57:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:31,598 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1208 transitions. [2024-10-11 17:57:31,598 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-11 17:57:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1208 transitions. [2024-10-11 17:57:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:31,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:31,599 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-11 17:57:31,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 17:57:31,599 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-11 17:57:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -119458546, now seen corresponding path program 1 times [2024-10-11 17:57:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910210976] [2024-10-11 17:57:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,802 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-11 17:57:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910210976] [2024-10-11 17:57:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910210976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404726263] [2024-10-11 17:57:31,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:31,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:31,805 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-11 17:57:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:32,021 INFO L93 Difference]: Finished difference Result 1279 states and 1788 transitions. [2024-10-11 17:57:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:57:32,021 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-11 17:57:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:32,029 INFO L225 Difference]: With dead ends: 1279 [2024-10-11 17:57:32,029 INFO L226 Difference]: Without dead ends: 1279 [2024-10-11 17:57:32,030 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-11 17:57:32,030 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-11 17:57:32,030 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-11 17:57:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-10-11 17:57:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1076. [2024-10-11 17:57:32,056 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-11 17:57:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1541 transitions. [2024-10-11 17:57:32,059 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1541 transitions. Word has length 46 [2024-10-11 17:57:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1541 transitions. [2024-10-11 17:57:32,059 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-11 17:57:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1541 transitions. [2024-10-11 17:57:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:32,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:32,060 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-11 17:57:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 17:57:32,061 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-11 17:57:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -721351339, now seen corresponding path program 1 times [2024-10-11 17:57:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349024690] [2024-10-11 17:57:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,289 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-11 17:57:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349024690] [2024-10-11 17:57:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349024690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902651748] [2024-10-11 17:57:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:32,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:32,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:32,290 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-11 17:57:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:32,581 INFO L93 Difference]: Finished difference Result 1316 states and 1847 transitions. [2024-10-11 17:57:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:32,582 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-11 17:57:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:32,589 INFO L225 Difference]: With dead ends: 1316 [2024-10-11 17:57:32,592 INFO L226 Difference]: Without dead ends: 1316 [2024-10-11 17:57:32,592 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-11 17:57:32,593 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-11 17:57:32,593 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-11 17:57:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-10-11 17:57:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 894. [2024-10-11 17:57:32,607 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-11 17:57:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1269 transitions. [2024-10-11 17:57:32,610 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1269 transitions. Word has length 46 [2024-10-11 17:57:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:32,610 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1269 transitions. [2024-10-11 17:57:32,610 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-11 17:57:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1269 transitions. [2024-10-11 17:57:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:32,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:32,611 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-11 17:57:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 17:57:32,612 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-11 17:57:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -664093037, now seen corresponding path program 1 times [2024-10-11 17:57:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511924036] [2024-10-11 17:57:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,980 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-11 17:57:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:32,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511924036] [2024-10-11 17:57:32,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511924036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:32,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290221432] [2024-10-11 17:57:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:32,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:32,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:57:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:33,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 17:57:33,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:33,363 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-11 17:57:33,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:33,397 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-11 17:57:33,463 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-11 17:57:33,469 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-11 17:57:33,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290221432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-11 17:57:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252491784] [2024-10-11 17:57:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:33,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:33,470 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-11 17:57:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:33,812 INFO L93 Difference]: Finished difference Result 1170 states and 1614 transitions. [2024-10-11 17:57:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:33,813 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-11 17:57:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:33,815 INFO L225 Difference]: With dead ends: 1170 [2024-10-11 17:57:33,815 INFO L226 Difference]: Without dead ends: 1170 [2024-10-11 17:57:33,815 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-11 17:57:33,816 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-11 17:57:33,816 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-11 17:57:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-10-11 17:57:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 803. [2024-10-11 17:57:33,827 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-11 17:57:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1135 transitions. [2024-10-11 17:57:33,828 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1135 transitions. Word has length 46 [2024-10-11 17:57:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:33,828 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1135 transitions. [2024-10-11 17:57:33,829 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-11 17:57:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1135 transitions. [2024-10-11 17:57:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:57:33,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:33,830 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-11 17:57:33,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:57:34,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:34,031 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-11 17:57:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1259808537, now seen corresponding path program 1 times [2024-10-11 17:57:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941401142] [2024-10-11 17:57:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:57:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,392 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-11 17:57:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941401142] [2024-10-11 17:57:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941401142] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615629906] [2024-10-11 17:57:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:34,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:34,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:57:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 17:57:34,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:34,720 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-11 17:57:34,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-11 17:57:34,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:34,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:34,930 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-11 17:57:34,934 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-11 17:57:35,055 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-11 17:57:35,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:35,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:35,167 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-11 17:57:35,296 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-11 17:57:35,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:35,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:35,318 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-11 17:57:35,474 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-11 17:57:35,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615629906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:35,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:35,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-11 17:57:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544010629] [2024-10-11 17:57:35,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:35,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 17:57:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 17:57:35,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:57:35,476 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-11 17:57:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:35,991 INFO L93 Difference]: Finished difference Result 1065 states and 1474 transitions. [2024-10-11 17:57:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:35,992 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-11 17:57:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:35,994 INFO L225 Difference]: With dead ends: 1065 [2024-10-11 17:57:35,994 INFO L226 Difference]: Without dead ends: 1065 [2024-10-11 17:57:35,994 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-11 17:57:35,995 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-11 17:57:35,995 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-11 17:57:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-11 17:57:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 878. [2024-10-11 17:57:36,005 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-11 17:57:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1243 transitions. [2024-10-11 17:57:36,006 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1243 transitions. Word has length 48 [2024-10-11 17:57:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:36,007 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1243 transitions. [2024-10-11 17:57:36,007 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-11 17:57:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1243 transitions. [2024-10-11 17:57:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:57:36,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:36,008 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-11 17:57:36,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:57:36,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-10-11 17:57:36,209 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-11 17:57:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1852072798, now seen corresponding path program 1 times [2024-10-11 17:57:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574616961] [2024-10-11 17:57:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:57:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,696 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-11 17:57:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574616961] [2024-10-11 17:57:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574616961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532918232] [2024-10-11 17:57:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:36,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:36,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:57:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 17:57:36,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:37,108 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-11 17:57:37,160 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-11 17:57:37,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:37,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:37,374 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-11 17:57:37,379 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-11 17:57:37,480 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-11 17:57:37,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:37,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:37,576 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-11 17:57:37,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2024-10-11 17:57:37,731 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-11 17:57:38,118 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-11 17:57:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532918232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:38,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2024-10-11 17:57:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188028069] [2024-10-11 17:57:38,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 17:57:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 17:57:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-10-11 17:57:38,120 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-11 17:57:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:39,096 INFO L93 Difference]: Finished difference Result 1150 states and 1577 transitions. [2024-10-11 17:57:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:57:39,097 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-11 17:57:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:39,098 INFO L225 Difference]: With dead ends: 1150 [2024-10-11 17:57:39,098 INFO L226 Difference]: Without dead ends: 1150 [2024-10-11 17:57:39,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=1650, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 17:57:39,099 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-11 17:57:39,099 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-11 17:57:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-11 17:57:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 797. [2024-10-11 17:57:39,109 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-11 17:57:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1122 transitions. [2024-10-11 17:57:39,111 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1122 transitions. Word has length 48 [2024-10-11 17:57:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:39,111 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1122 transitions. [2024-10-11 17:57:39,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-11 17:57:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1122 transitions. [2024-10-11 17:57:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:57:39,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:39,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-11 17:57:39,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:57:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:39,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-11 17:57:39,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 399721909, now seen corresponding path program 1 times [2024-10-11 17:57:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734897314] [2024-10-11 17:57:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:57:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:39,438 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-11 17:57:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734897314] [2024-10-11 17:57:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734897314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607160558] [2024-10-11 17:57:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:39,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:39,440 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-11 17:57:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:39,560 INFO L93 Difference]: Finished difference Result 800 states and 1105 transitions. [2024-10-11 17:57:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:39,561 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-11 17:57:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:39,562 INFO L225 Difference]: With dead ends: 800 [2024-10-11 17:57:39,562 INFO L226 Difference]: Without dead ends: 800 [2024-10-11 17:57:39,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:39,563 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-11 17:57:39,563 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-11 17:57:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-11 17:57:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2024-10-11 17:57:39,571 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-11 17:57:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1099 transitions. [2024-10-11 17:57:39,573 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1099 transitions. Word has length 49 [2024-10-11 17:57:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1099 transitions. [2024-10-11 17:57:39,573 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-11 17:57:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1099 transitions. [2024-10-11 17:57:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:57:39,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:39,574 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-11 17:57:39,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 17:57:39,574 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-11 17:57:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666086, now seen corresponding path program 1 times [2024-10-11 17:57:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104598263] [2024-10-11 17:57:39,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 17:57:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,058 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-11 17:57:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104598263] [2024-10-11 17:57:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104598263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608233335] [2024-10-11 17:57:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:40,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:40,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:57:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 17:57:40,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:40,315 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-11 17:57:40,350 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-11 17:57:40,448 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-11 17:57:40,448 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-11 17:57:40,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:40,504 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-11 17:57:40,506 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-11 17:57:40,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608233335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:40,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:57:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2024-10-11 17:57:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539175969] [2024-10-11 17:57:40,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:40,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:57:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:57:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:40,593 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-11 17:57:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:41,487 INFO L93 Difference]: Finished difference Result 1282 states and 1719 transitions. [2024-10-11 17:57:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:57:41,487 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-11 17:57:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:41,489 INFO L225 Difference]: With dead ends: 1282 [2024-10-11 17:57:41,490 INFO L226 Difference]: Without dead ends: 1282 [2024-10-11 17:57:41,490 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-11 17:57:41,490 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-11 17:57:41,491 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-11 17:57:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-11 17:57:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 854. [2024-10-11 17:57:41,504 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-11 17:57:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1182 transitions. [2024-10-11 17:57:41,506 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1182 transitions. Word has length 49 [2024-10-11 17:57:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:41,506 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1182 transitions. [2024-10-11 17:57:41,506 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-11 17:57:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1182 transitions. [2024-10-11 17:57:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:57:41,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:41,507 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-11 17:57:41,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:57:41,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-10-11 17:57:41,708 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-11 17:57:41,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1822666087, now seen corresponding path program 1 times [2024-10-11 17:57:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796850161] [2024-10-11 17:57:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 17:57:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:42,742 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-11 17:57:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796850161] [2024-10-11 17:57:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796850161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261972496] [2024-10-11 17:57:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:42,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:42,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:57:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:42,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 17:57:42,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:42,935 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-11 17:57:43,120 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-11 17:57:43,138 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-11 17:57:43,205 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-11 17:57:43,210 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-11 17:57:43,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:43,343 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-11 17:57:43,353 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-10-11 17:57:43,353 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-11 17:57:47,612 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-11 17:57:47,642 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-11 17:57:47,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261972496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:47,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:57:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 28 [2024-10-11 17:57:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759953942] [2024-10-11 17:57:47,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 17:57:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 17:57:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1023, Unknown=1, NotChecked=0, Total=1122 [2024-10-11 17:57:47,886 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-11 17:57:53,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:09,531 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-11 17:58:13,557 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]