./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:52:37,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:52:37,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:52:37,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:52:37,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:52:37,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:52:37,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:52:37,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:52:37,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:52:37,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:52:37,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:52:37,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:52:37,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:52:37,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:52:37,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:52:37,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:52:37,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:52:37,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:52:37,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:52:37,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:52:37,355 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:52:37,356 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:52:37,356 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:52:37,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:52:37,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:52:37,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:52:37,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:52:37,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:52:37,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:52:37,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:52:37,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:52:37,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:52:37,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:52:37,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:52:37,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:52:37,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:52:37,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:52:37,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:52:37,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:52:37,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:52:37,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:52:37,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:52:37,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a [2024-10-14 17:52:37,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:52:37,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:52:37,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:52:37,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:52:37,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:52:37,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2024-10-14 17:52:39,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:52:39,266 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:52:39,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2024-10-14 17:52:39,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41ddc7cc/b98abf8918dc41bdb8488380219bfcef/FLAG3e0c0c02a [2024-10-14 17:52:39,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41ddc7cc/b98abf8918dc41bdb8488380219bfcef [2024-10-14 17:52:39,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:52:39,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:52:39,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:39,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:52:39,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:52:39,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:39" (1/1) ... [2024-10-14 17:52:39,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5512e05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:39, skipping insertion in model container [2024-10-14 17:52:39,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:52:39" (1/1) ... [2024-10-14 17:52:39,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:52:40,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:40,040 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:52:40,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:52:40,185 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:52:40,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40 WrapperNode [2024-10-14 17:52:40,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:52:40,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:52:40,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:52:40,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:52:40,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,240 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 254 [2024-10-14 17:52:40,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:52:40,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:52:40,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:52:40,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:52:40,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,285 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2024-10-14 17:52:40,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:52:40,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:52:40,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:52:40,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:52:40,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (1/1) ... [2024-10-14 17:52:40,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:52:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:52:40,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:52:40,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:52:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-14 17:52:40,372 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:52:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:52:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:52:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:52:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 17:52:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 17:52:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:52:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:52:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:52:40,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:52:40,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:52:40,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:52:40,966 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2024-10-14 17:52:40,966 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:52:41,017 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:52:41,018 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 17:52:41,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:52:41 BoogieIcfgContainer [2024-10-14 17:52:41,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:52:41,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:52:41,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:52:41,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:52:41,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:52:39" (1/3) ... [2024-10-14 17:52:41,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5a30e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:52:41, skipping insertion in model container [2024-10-14 17:52:41,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:52:40" (2/3) ... [2024-10-14 17:52:41,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5a30e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:52:41, skipping insertion in model container [2024-10-14 17:52:41,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:52:41" (3/3) ... [2024-10-14 17:52:41,027 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217_1.i [2024-10-14 17:52:41,044 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:52:41,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-14 17:52:41,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:52:41,098 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;@249f657c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:52:41,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-10-14 17:52:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.2) internal successors, (176), 147 states have internal predecessors, (176), 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-14 17:52:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:52:41,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:41,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:52:41,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:41,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash 348415767, now seen corresponding path program 1 times [2024-10-14 17:52:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039868624] [2024-10-14 17:52:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:41,275 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-14 17:52:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039868624] [2024-10-14 17:52:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039868624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909682369] [2024-10-14 17:52:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:52:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:52:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:52:41,314 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.2) internal successors, (176), 147 states have internal predecessors, (176), 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-14 17:52:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:41,380 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2024-10-14 17:52:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:52:41,383 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-14 17:52:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:41,391 INFO L225 Difference]: With dead ends: 151 [2024-10-14 17:52:41,391 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 17:52:41,392 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-14 17:52:41,395 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:41,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:52:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 17:52:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-14 17:52:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 80 states have (on average 2.1) internal successors, (168), 146 states have internal predecessors, (168), 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-14 17:52:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2024-10-14 17:52:41,436 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 5 [2024-10-14 17:52:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:41,436 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2024-10-14 17:52:41,436 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-14 17:52:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2024-10-14 17:52:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:52:41,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:41,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:52:41,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash 543993533, now seen corresponding path program 1 times [2024-10-14 17:52:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740609424] [2024-10-14 17:52:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:41,567 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-14 17:52:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:41,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740609424] [2024-10-14 17:52:41,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740609424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:41,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:41,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669772869] [2024-10-14 17:52:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:41,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:41,572 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:41,694 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2024-10-14 17:52:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:41,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:52:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:41,697 INFO L225 Difference]: With dead ends: 296 [2024-10-14 17:52:41,697 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 17:52:41,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:41,701 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 163 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:41,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 454 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 17:52:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 152. [2024-10-14 17:52:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 82 states have (on average 2.073170731707317) internal successors, (170), 148 states have internal predecessors, (170), 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-14 17:52:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2024-10-14 17:52:41,726 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 7 [2024-10-14 17:52:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:41,726 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2024-10-14 17:52:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2024-10-14 17:52:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:52:41,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:41,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:41,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:52:41,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:41,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:41,729 INFO L85 PathProgramCache]: Analyzing trace with hash 542146491, now seen corresponding path program 1 times [2024-10-14 17:52:41,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:41,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478283151] [2024-10-14 17:52:41,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:41,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-14 17:52:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478283151] [2024-10-14 17:52:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478283151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:52:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659037342] [2024-10-14 17:52:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:41,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:41,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:41,847 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:42,056 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2024-10-14 17:52:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:52:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:42,061 INFO L225 Difference]: With dead ends: 295 [2024-10-14 17:52:42,061 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 17:52:42,064 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-14 17:52:42,065 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 154 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:42,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 208 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 17:52:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 207. [2024-10-14 17:52:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 134 states have (on average 2.0597014925373136) internal successors, (276), 200 states have internal predecessors, (276), 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-14 17:52:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 284 transitions. [2024-10-14 17:52:42,091 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 284 transitions. Word has length 7 [2024-10-14 17:52:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:42,091 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 284 transitions. [2024-10-14 17:52:42,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 284 transitions. [2024-10-14 17:52:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:52:42,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:42,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:52:42,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 542146492, now seen corresponding path program 1 times [2024-10-14 17:52:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027599591] [2024-10-14 17:52:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:42,237 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-14 17:52:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:42,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027599591] [2024-10-14 17:52:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027599591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:42,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896340571] [2024-10-14 17:52:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:42,240 INFO L87 Difference]: Start difference. First operand 207 states and 284 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:42,446 INFO L93 Difference]: Finished difference Result 328 states and 434 transitions. [2024-10-14 17:52:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:52:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:42,448 INFO L225 Difference]: With dead ends: 328 [2024-10-14 17:52:42,448 INFO L226 Difference]: Without dead ends: 328 [2024-10-14 17:52:42,449 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-14 17:52:42,450 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 100 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:42,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 351 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-14 17:52:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 279. [2024-10-14 17:52:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 200 states have (on average 1.99) internal successors, (398), 268 states have internal predecessors, (398), 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-14 17:52:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2024-10-14 17:52:42,477 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 7 [2024-10-14 17:52:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:42,477 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2024-10-14 17:52:42,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2024-10-14 17:52:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:52:42,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:42,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:52:42,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash 542146554, now seen corresponding path program 1 times [2024-10-14 17:52:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971409117] [2024-10-14 17:52:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:42,594 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-14 17:52:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:42,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971409117] [2024-10-14 17:52:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971409117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:42,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:42,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594585855] [2024-10-14 17:52:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:42,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:42,599 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:42,766 INFO L93 Difference]: Finished difference Result 327 states and 432 transitions. [2024-10-14 17:52:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:52:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:42,768 INFO L225 Difference]: With dead ends: 327 [2024-10-14 17:52:42,768 INFO L226 Difference]: Without dead ends: 327 [2024-10-14 17:52:42,769 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-14 17:52:42,769 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 98 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:42,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 352 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-14 17:52:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 279. [2024-10-14 17:52:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 200 states have (on average 1.99) internal successors, (398), 268 states have internal predecessors, (398), 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-14 17:52:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2024-10-14 17:52:42,787 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 7 [2024-10-14 17:52:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:42,787 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2024-10-14 17:52:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:52:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2024-10-14 17:52:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:52:42,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:42,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:42,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:52:42,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:42,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1311781123, now seen corresponding path program 1 times [2024-10-14 17:52:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266189587] [2024-10-14 17:52:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:42,828 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-14 17:52:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266189587] [2024-10-14 17:52:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266189587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176341810] [2024-10-14 17:52:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:42,831 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-14 17:52:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:42,889 INFO L93 Difference]: Finished difference Result 398 states and 549 transitions. [2024-10-14 17:52:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-14 17:52:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:42,895 INFO L225 Difference]: With dead ends: 398 [2024-10-14 17:52:42,895 INFO L226 Difference]: Without dead ends: 398 [2024-10-14 17:52:42,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:42,896 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 143 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:42,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 301 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-14 17:52:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 280. [2024-10-14 17:52:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 201 states have (on average 1.9751243781094527) internal successors, (397), 269 states have internal predecessors, (397), 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-14 17:52:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2024-10-14 17:52:42,908 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 9 [2024-10-14 17:52:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:42,908 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2024-10-14 17:52:42,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-14 17:52:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2024-10-14 17:52:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:52:42,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:42,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:42,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:52:42,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2010507914, now seen corresponding path program 1 times [2024-10-14 17:52:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:42,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082094419] [2024-10-14 17:52:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:42,939 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-14 17:52:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082094419] [2024-10-14 17:52:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082094419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:52:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878264085] [2024-10-14 17:52:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:42,942 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 17:52:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:43,065 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-10-14 17:52:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-14 17:52:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:43,069 INFO L225 Difference]: With dead ends: 328 [2024-10-14 17:52:43,069 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 17:52:43,069 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-14 17:52:43,072 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 66 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 236 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-14 17:52:43,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 236 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 17:52:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 277. [2024-10-14 17:52:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.97979797979798) internal successors, (392), 266 states have internal predecessors, (392), 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-14 17:52:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2024-10-14 17:52:43,079 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 10 [2024-10-14 17:52:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:43,079 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2024-10-14 17:52:43,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 17:52:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2024-10-14 17:52:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:52:43,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:43,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:43,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:52:43,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:43,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1415086410, now seen corresponding path program 1 times [2024-10-14 17:52:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947222532] [2024-10-14 17:52:43,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:43,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947222532] [2024-10-14 17:52:43,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947222532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:43,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:43,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413182573] [2024-10-14 17:52:43,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:43,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:43,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:43,137 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-14 17:52:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:43,211 INFO L93 Difference]: Finished difference Result 448 states and 647 transitions. [2024-10-14 17:52:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-14 17:52:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:43,213 INFO L225 Difference]: With dead ends: 448 [2024-10-14 17:52:43,214 INFO L226 Difference]: Without dead ends: 448 [2024-10-14 17:52:43,214 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-14 17:52:43,215 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 159 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:43,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 431 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-14 17:52:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 281. [2024-10-14 17:52:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.9504950495049505) internal successors, (394), 270 states have internal predecessors, (394), 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-14 17:52:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 410 transitions. [2024-10-14 17:52:43,224 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 410 transitions. Word has length 16 [2024-10-14 17:52:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:43,226 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 410 transitions. [2024-10-14 17:52:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-14 17:52:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2024-10-14 17:52:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:52:43,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:43,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:43,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:52:43,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:43,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2116150988, now seen corresponding path program 1 times [2024-10-14 17:52:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362342137] [2024-10-14 17:52:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,256 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-14 17:52:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362342137] [2024-10-14 17:52:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362342137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381278314] [2024-10-14 17:52:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:43,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:43,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:43,260 INFO L87 Difference]: Start difference. First operand 281 states and 410 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 17:52:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:43,298 INFO L93 Difference]: Finished difference Result 285 states and 414 transitions. [2024-10-14 17:52:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 17:52:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:43,301 INFO L225 Difference]: With dead ends: 285 [2024-10-14 17:52:43,301 INFO L226 Difference]: Without dead ends: 285 [2024-10-14 17:52:43,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 17:52:43,303 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:43,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:52:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-14 17:52:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-14 17:52:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 206 states have (on average 1.9320388349514563) internal successors, (398), 274 states have internal predecessors, (398), 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-14 17:52:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 414 transitions. [2024-10-14 17:52:43,311 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 414 transitions. Word has length 16 [2024-10-14 17:52:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:43,312 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 414 transitions. [2024-10-14 17:52:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 17:52:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 414 transitions. [2024-10-14 17:52:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:52:43,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:43,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:43,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:52:43,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1306804362, now seen corresponding path program 1 times [2024-10-14 17:52:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455085253] [2024-10-14 17:52:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,418 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-14 17:52:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455085253] [2024-10-14 17:52:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455085253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528181017] [2024-10-14 17:52:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:43,421 INFO L87 Difference]: Start difference. First operand 285 states and 414 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:43,644 INFO L93 Difference]: Finished difference Result 387 states and 503 transitions. [2024-10-14 17:52:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:43,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:43,647 INFO L225 Difference]: With dead ends: 387 [2024-10-14 17:52:43,647 INFO L226 Difference]: Without dead ends: 387 [2024-10-14 17:52:43,647 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-14 17:52:43,648 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:43,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 301 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-14 17:52:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 291. [2024-10-14 17:52:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.9056603773584906) internal successors, (404), 280 states have internal predecessors, (404), 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-14 17:52:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2024-10-14 17:52:43,657 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 16 [2024-10-14 17:52:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:43,657 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2024-10-14 17:52:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2024-10-14 17:52:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:52:43,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:43,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:52:43,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1306804361, now seen corresponding path program 1 times [2024-10-14 17:52:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905630973] [2024-10-14 17:52:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:43,757 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-14 17:52:43,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905630973] [2024-10-14 17:52:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905630973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:43,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:43,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722236649] [2024-10-14 17:52:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:43,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:43,760 INFO L87 Difference]: Start difference. First operand 291 states and 420 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:43,923 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2024-10-14 17:52:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:43,925 INFO L225 Difference]: With dead ends: 324 [2024-10-14 17:52:43,925 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 17:52:43,925 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-14 17:52:43,925 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:43,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 361 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 17:52:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2024-10-14 17:52:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.8773584905660377) internal successors, (398), 280 states have internal predecessors, (398), 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-14 17:52:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 414 transitions. [2024-10-14 17:52:43,932 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 414 transitions. Word has length 16 [2024-10-14 17:52:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:43,932 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 414 transitions. [2024-10-14 17:52:43,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-14 17:52:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 414 transitions. [2024-10-14 17:52:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:52:43,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:43,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:43,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:52:43,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:43,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 943605357, now seen corresponding path program 1 times [2024-10-14 17:52:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046170880] [2024-10-14 17:52:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:44,057 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-14 17:52:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:44,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046170880] [2024-10-14 17:52:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046170880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661570398] [2024-10-14 17:52:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:44,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:44,061 INFO L87 Difference]: Start difference. First operand 291 states and 414 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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-14 17:52:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:44,298 INFO L93 Difference]: Finished difference Result 395 states and 518 transitions. [2024-10-14 17:52:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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-14 17:52:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:44,301 INFO L225 Difference]: With dead ends: 395 [2024-10-14 17:52:44,301 INFO L226 Difference]: Without dead ends: 395 [2024-10-14 17:52:44,302 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-14 17:52:44,302 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 281 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:44,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 288 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-14 17:52:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 288. [2024-10-14 17:52:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 213 states have (on average 1.84037558685446) internal successors, (392), 277 states have internal predecessors, (392), 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-14 17:52:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 408 transitions. [2024-10-14 17:52:44,312 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 408 transitions. Word has length 17 [2024-10-14 17:52:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 408 transitions. [2024-10-14 17:52:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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-14 17:52:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 408 transitions. [2024-10-14 17:52:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:52:44,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:44,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:44,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:52:44,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 943605358, now seen corresponding path program 1 times [2024-10-14 17:52:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648844534] [2024-10-14 17:52:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:44,547 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-14 17:52:44,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:44,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648844534] [2024-10-14 17:52:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648844534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:52:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260636337] [2024-10-14 17:52:44,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:52:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:52:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:44,549 INFO L87 Difference]: Start difference. First operand 288 states and 408 transitions. Second operand has 7 states, 6 states have (on average 2.5) 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-14 17:52:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:44,962 INFO L93 Difference]: Finished difference Result 406 states and 520 transitions. [2024-10-14 17:52:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:52:44,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) 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-14 17:52:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:44,964 INFO L225 Difference]: With dead ends: 406 [2024-10-14 17:52:44,964 INFO L226 Difference]: Without dead ends: 406 [2024-10-14 17:52:44,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:52:44,964 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 211 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:44,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 465 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:52:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-14 17:52:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 302. [2024-10-14 17:52:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 227 states have (on average 1.854625550660793) internal successors, (421), 291 states have internal predecessors, (421), 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-14 17:52:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2024-10-14 17:52:44,972 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 17 [2024-10-14 17:52:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:44,972 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2024-10-14 17:52:44,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) 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-14 17:52:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2024-10-14 17:52:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:52:44,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:44,973 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-14 17:52:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:52:44,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:44,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1083822630, now seen corresponding path program 1 times [2024-10-14 17:52:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083315996] [2024-10-14 17:52:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,173 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-14 17:52:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:45,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083315996] [2024-10-14 17:52:45,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083315996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:45,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:45,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:52:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028122605] [2024-10-14 17:52:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:45,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:45,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:45,175 INFO L87 Difference]: Start difference. First operand 302 states and 437 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-14 17:52:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:45,417 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2024-10-14 17:52:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:45,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-14 17:52:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:45,420 INFO L225 Difference]: With dead ends: 413 [2024-10-14 17:52:45,420 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 17:52:45,420 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-14 17:52:45,420 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 92 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:45,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 683 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 17:52:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 333. [2024-10-14 17:52:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 255 states have (on average 1.8352941176470587) internal successors, (468), 320 states have internal predecessors, (468), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:52:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 488 transitions. [2024-10-14 17:52:45,430 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 488 transitions. Word has length 20 [2024-10-14 17:52:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 488 transitions. [2024-10-14 17:52:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-14 17:52:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 488 transitions. [2024-10-14 17:52:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:52:45,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:45,432 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-14 17:52:45,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:52:45,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 393964893, now seen corresponding path program 1 times [2024-10-14 17:52:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141520014] [2024-10-14 17:52:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,616 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-14 17:52:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141520014] [2024-10-14 17:52:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141520014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:52:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859974283] [2024-10-14 17:52:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:52:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:52:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:45,618 INFO L87 Difference]: Start difference. First operand 333 states and 488 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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-14 17:52:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:45,831 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2024-10-14 17:52:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:52:45,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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-14 17:52:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:45,833 INFO L225 Difference]: With dead ends: 393 [2024-10-14 17:52:45,833 INFO L226 Difference]: Without dead ends: 393 [2024-10-14 17:52:45,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-14 17:52:45,833 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 91 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:45,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 771 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-14 17:52:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 351. [2024-10-14 17:52:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.8021978021978022) internal successors, (492), 336 states have internal predecessors, (492), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:52:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 512 transitions. [2024-10-14 17:52:45,855 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 512 transitions. Word has length 20 [2024-10-14 17:52:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 512 transitions. [2024-10-14 17:52:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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-14 17:52:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 512 transitions. [2024-10-14 17:52:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:52:45,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:45,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:45,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:52:45,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 761609393, now seen corresponding path program 1 times [2024-10-14 17:52:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:45,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293600348] [2024-10-14 17:52:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:45,916 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-14 17:52:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:45,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293600348] [2024-10-14 17:52:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293600348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951641110] [2024-10-14 17:52:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:45,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:45,918 INFO L87 Difference]: Start difference. First operand 351 states and 512 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:46,055 INFO L93 Difference]: Finished difference Result 354 states and 509 transitions. [2024-10-14 17:52:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 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 21 [2024-10-14 17:52:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:46,058 INFO L225 Difference]: With dead ends: 354 [2024-10-14 17:52:46,058 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 17:52:46,058 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-14 17:52:46,058 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 26 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:46,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 413 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 17:52:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-10-14 17:52:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 276 states have (on average 1.7427536231884058) internal successors, (481), 333 states have internal predecessors, (481), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:52:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 501 transitions. [2024-10-14 17:52:46,066 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 501 transitions. Word has length 21 [2024-10-14 17:52:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:46,066 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 501 transitions. [2024-10-14 17:52:46,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 501 transitions. [2024-10-14 17:52:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:52:46,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:46,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:46,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:52:46,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:46,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 761609394, now seen corresponding path program 1 times [2024-10-14 17:52:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90663260] [2024-10-14 17:52:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 17:52:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90663260] [2024-10-14 17:52:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90663260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:46,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:52:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660174022] [2024-10-14 17:52:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:46,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:52:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:46,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:52:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:46,201 INFO L87 Difference]: Start difference. First operand 348 states and 501 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:46,345 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-10-14 17:52:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:46,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 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 21 [2024-10-14 17:52:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:46,347 INFO L225 Difference]: With dead ends: 258 [2024-10-14 17:52:46,348 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 17:52:46,348 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-14 17:52:46,349 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 36 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:46,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 662 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 17:52:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-10-14 17:52:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.797872340425532) internal successors, (338), 244 states have internal predecessors, (338), 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-14 17:52:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions. [2024-10-14 17:52:46,355 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 21 [2024-10-14 17:52:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions. [2024-10-14 17:52:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions. [2024-10-14 17:52:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:52:46,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:46,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:46,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:52:46,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:46,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash -671702513, now seen corresponding path program 1 times [2024-10-14 17:52:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437208106] [2024-10-14 17:52:46,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,393 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-14 17:52:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:46,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437208106] [2024-10-14 17:52:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437208106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:52:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517556520] [2024-10-14 17:52:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:46,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:52:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:52:46,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:52:46,395 INFO L87 Difference]: Start difference. First operand 254 states and 350 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:46,469 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2024-10-14 17:52:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:52:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 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 21 [2024-10-14 17:52:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:46,470 INFO L225 Difference]: With dead ends: 251 [2024-10-14 17:52:46,470 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 17:52:46,470 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-14 17:52:46,471 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:46,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 17:52:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-14 17:52:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 188 states have (on average 1.75) internal successors, (329), 241 states have internal predecessors, (329), 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-14 17:52:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 341 transitions. [2024-10-14 17:52:46,478 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 341 transitions. Word has length 21 [2024-10-14 17:52:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:46,478 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 341 transitions. [2024-10-14 17:52:46,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 341 transitions. [2024-10-14 17:52:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:52:46,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:46,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:52:46,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:52:46,481 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:46,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -671702512, now seen corresponding path program 1 times [2024-10-14 17:52:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994864386] [2024-10-14 17:52:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994864386] [2024-10-14 17:52:46,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994864386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:52:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318529464] [2024-10-14 17:52:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:46,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:46,572 INFO L87 Difference]: Start difference. First operand 251 states and 341 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:46,695 INFO L93 Difference]: Finished difference Result 288 states and 394 transitions. [2024-10-14 17:52:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 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 21 [2024-10-14 17:52:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:46,697 INFO L225 Difference]: With dead ends: 288 [2024-10-14 17:52:46,697 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 17:52:46,698 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-14 17:52:46,698 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:46,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 17:52:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2024-10-14 17:52:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 220 states have (on average 1.7363636363636363) internal successors, (382), 272 states have internal predecessors, (382), 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-14 17:52:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 394 transitions. [2024-10-14 17:52:46,705 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 394 transitions. Word has length 21 [2024-10-14 17:52:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:46,706 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 394 transitions. [2024-10-14 17:52:46,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 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-14 17:52:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-10-14 17:52:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:52:46,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:46,707 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-14 17:52:46,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:52:46,707 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1872197656, now seen corresponding path program 1 times [2024-10-14 17:52:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360738144] [2024-10-14 17:52:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,785 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-14 17:52:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360738144] [2024-10-14 17:52:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360738144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:52:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778844588] [2024-10-14 17:52:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:46,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:46,788 INFO L87 Difference]: Start difference. First operand 282 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 17:52:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:46,866 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2024-10-14 17:52:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 17:52:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:46,867 INFO L225 Difference]: With dead ends: 246 [2024-10-14 17:52:46,868 INFO L226 Difference]: Without dead ends: 246 [2024-10-14 17:52:46,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-14 17:52:46,868 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 36 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:46,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 637 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-14 17:52:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-14 17:52:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 185 states have (on average 1.6972972972972973) internal successors, (314), 236 states have internal predecessors, (314), 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-14 17:52:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 326 transitions. [2024-10-14 17:52:46,873 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 326 transitions. Word has length 22 [2024-10-14 17:52:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:46,873 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 326 transitions. [2024-10-14 17:52:46,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 17:52:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 326 transitions. [2024-10-14 17:52:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:52:46,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:46,874 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-14 17:52:46,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:52:46,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1261017870, now seen corresponding path program 1 times [2024-10-14 17:52:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833061531] [2024-10-14 17:52:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:46,954 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-14 17:52:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833061531] [2024-10-14 17:52:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833061531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276354692] [2024-10-14 17:52:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:46,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:46,956 INFO L87 Difference]: Start difference. First operand 246 states and 326 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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-14 17:52:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:47,048 INFO L93 Difference]: Finished difference Result 245 states and 323 transitions. [2024-10-14 17:52:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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-14 17:52:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:47,049 INFO L225 Difference]: With dead ends: 245 [2024-10-14 17:52:47,049 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 17:52:47,049 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-14 17:52:47,050 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 19 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:47,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 17:52:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-14 17:52:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 185 states have (on average 1.681081081081081) internal successors, (311), 235 states have internal predecessors, (311), 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-14 17:52:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2024-10-14 17:52:47,055 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 23 [2024-10-14 17:52:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:47,055 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2024-10-14 17:52:47,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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-14 17:52:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2024-10-14 17:52:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:52:47,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:47,056 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-14 17:52:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:52:47,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:47,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1261018063, now seen corresponding path program 1 times [2024-10-14 17:52:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:47,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527603496] [2024-10-14 17:52:47,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,132 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-14 17:52:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527603496] [2024-10-14 17:52:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527603496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:47,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:52:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477335837] [2024-10-14 17:52:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:47,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,134 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand has 5 states, 5 states have (on average 4.2) 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-14 17:52:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:47,251 INFO L93 Difference]: Finished difference Result 272 states and 357 transitions. [2024-10-14 17:52:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) 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-14 17:52:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:47,255 INFO L225 Difference]: With dead ends: 272 [2024-10-14 17:52:47,255 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 17:52:47,255 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-14 17:52:47,255 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 7 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:47,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 474 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 17:52:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2024-10-14 17:52:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 206 states have (on average 1.6359223300970873) internal successors, (337), 256 states have internal predecessors, (337), 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-14 17:52:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2024-10-14 17:52:47,262 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 23 [2024-10-14 17:52:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:47,263 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2024-10-14 17:52:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) 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-14 17:52:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2024-10-14 17:52:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 17:52:47,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:47,263 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-14 17:52:47,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:52:47,264 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:47,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -187260227, now seen corresponding path program 1 times [2024-10-14 17:52:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823476717] [2024-10-14 17:52:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,331 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-14 17:52:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823476717] [2024-10-14 17:52:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823476717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557143866] [2024-10-14 17:52:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,333 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:47,449 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2024-10-14 17:52:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:47,450 INFO L225 Difference]: With dead ends: 267 [2024-10-14 17:52:47,450 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 17:52:47,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,451 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 44 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:47,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 378 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 17:52:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2024-10-14 17:52:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 206 states have (on average 1.6262135922330097) internal successors, (335), 255 states have internal predecessors, (335), 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-14 17:52:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 347 transitions. [2024-10-14 17:52:47,481 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 347 transitions. Word has length 27 [2024-10-14 17:52:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:47,481 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 347 transitions. [2024-10-14 17:52:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 347 transitions. [2024-10-14 17:52:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 17:52:47,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:47,482 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-14 17:52:47,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:52:47,482 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:47,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash -187260226, now seen corresponding path program 1 times [2024-10-14 17:52:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000517755] [2024-10-14 17:52:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,586 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-14 17:52:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000517755] [2024-10-14 17:52:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000517755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179741501] [2024-10-14 17:52:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,590 INFO L87 Difference]: Start difference. First operand 265 states and 347 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:47,704 INFO L93 Difference]: Finished difference Result 266 states and 347 transitions. [2024-10-14 17:52:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:47,706 INFO L225 Difference]: With dead ends: 266 [2024-10-14 17:52:47,706 INFO L226 Difference]: Without dead ends: 266 [2024-10-14 17:52:47,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,707 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:47,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 378 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-14 17:52:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-14 17:52:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 206 states have (on average 1.616504854368932) internal successors, (333), 254 states have internal predecessors, (333), 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-14 17:52:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2024-10-14 17:52:47,712 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 27 [2024-10-14 17:52:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:47,712 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2024-10-14 17:52:47,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 17:52:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2024-10-14 17:52:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:52:47,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:47,713 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-14 17:52:47,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:52:47,714 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 431551966, now seen corresponding path program 1 times [2024-10-14 17:52:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119839384] [2024-10-14 17:52:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:47,784 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-14 17:52:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:47,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119839384] [2024-10-14 17:52:47,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119839384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:47,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483857422] [2024-10-14 17:52:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:47,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:52:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:47,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:52:47,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:52:47,786 INFO L87 Difference]: Start difference. First operand 264 states and 345 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-14 17:52:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:47,923 INFO L93 Difference]: Finished difference Result 293 states and 381 transitions. [2024-10-14 17:52:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:52:47,924 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-14 17:52:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:47,925 INFO L225 Difference]: With dead ends: 293 [2024-10-14 17:52:47,925 INFO L226 Difference]: Without dead ends: 293 [2024-10-14 17:52:47,925 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-14 17:52:47,926 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:47,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 382 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-14 17:52:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 261. [2024-10-14 17:52:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.587378640776699) internal successors, (327), 251 states have internal predecessors, (327), 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-14 17:52:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2024-10-14 17:52:47,930 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 29 [2024-10-14 17:52:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2024-10-14 17:52:47,931 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-14 17:52:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2024-10-14 17:52:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:52:47,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:47,931 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-14 17:52:47,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:52:47,932 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 431551967, now seen corresponding path program 1 times [2024-10-14 17:52:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292718994] [2024-10-14 17:52:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:48,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:48,114 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-14 17:52:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292718994] [2024-10-14 17:52:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292718994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:48,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:48,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:52:48,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002671919] [2024-10-14 17:52:48,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:48,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:48,118 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-14 17:52:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:48,318 INFO L93 Difference]: Finished difference Result 292 states and 379 transitions. [2024-10-14 17:52:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:48,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-14 17:52:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:48,321 INFO L225 Difference]: With dead ends: 292 [2024-10-14 17:52:48,322 INFO L226 Difference]: Without dead ends: 292 [2024-10-14 17:52:48,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:52:48,322 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 243 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:48,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 362 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-14 17:52:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 260. [2024-10-14 17:52:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 250 states have internal predecessors, (325), 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-14 17:52:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 337 transitions. [2024-10-14 17:52:48,328 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 337 transitions. Word has length 29 [2024-10-14 17:52:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:48,328 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 337 transitions. [2024-10-14 17:52:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-14 17:52:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 337 transitions. [2024-10-14 17:52:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:52:48,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:48,328 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-14 17:52:48,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:52:48,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:48,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash 431552128, now seen corresponding path program 1 times [2024-10-14 17:52:48,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:48,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250034861] [2024-10-14 17:52:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:48,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250034861] [2024-10-14 17:52:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250034861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:48,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:48,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:52:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368339823] [2024-10-14 17:52:48,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:48,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:52:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:52:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:52:48,601 INFO L87 Difference]: Start difference. First operand 260 states and 337 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-14 17:52:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:49,008 INFO L93 Difference]: Finished difference Result 327 states and 384 transitions. [2024-10-14 17:52:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:52:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-14 17:52:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:49,010 INFO L225 Difference]: With dead ends: 327 [2024-10-14 17:52:49,010 INFO L226 Difference]: Without dead ends: 327 [2024-10-14 17:52:49,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:52:49,011 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 229 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:49,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 453 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:52:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-14 17:52:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 260. [2024-10-14 17:52:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5679611650485437) internal successors, (323), 250 states have internal predecessors, (323), 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-14 17:52:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2024-10-14 17:52:49,016 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 29 [2024-10-14 17:52:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:49,017 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2024-10-14 17:52:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-14 17:52:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2024-10-14 17:52:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 17:52:49,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:49,017 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] [2024-10-14 17:52:49,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:52:49,018 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1044600501, now seen corresponding path program 1 times [2024-10-14 17:52:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:49,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290098547] [2024-10-14 17:52:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 17:52:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290098547] [2024-10-14 17:52:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290098547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:52:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638318306] [2024-10-14 17:52:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:52:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:52:49,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:52:49,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:52:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:49,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:52:49,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:49,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:52:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638318306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:52:49,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:52:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 17:52:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379841888] [2024-10-14 17:52:49,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:52:49,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:52:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:52:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:52:49,375 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 17:52:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:49,555 INFO L93 Difference]: Finished difference Result 1008 states and 1335 transitions. [2024-10-14 17:52:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:52:49,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2024-10-14 17:52:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:49,558 INFO L225 Difference]: With dead ends: 1008 [2024-10-14 17:52:49,558 INFO L226 Difference]: Without dead ends: 1008 [2024-10-14 17:52:49,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:52:49,559 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 582 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:49,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 789 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-10-14 17:52:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 560. [2024-10-14 17:52:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 500 states have (on average 1.576) internal successors, (788), 544 states have internal predecessors, (788), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 17:52:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 812 transitions. [2024-10-14 17:52:49,575 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 812 transitions. Word has length 43 [2024-10-14 17:52:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:49,575 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 812 transitions. [2024-10-14 17:52:49,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-14 17:52:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 812 transitions. [2024-10-14 17:52:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 17:52:49,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:49,577 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] [2024-10-14 17:52:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:52:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 17:52:49,782 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 343535923, now seen corresponding path program 1 times [2024-10-14 17:52:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972365274] [2024-10-14 17:52:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 17:52:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972365274] [2024-10-14 17:52:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972365274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:52:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384849586] [2024-10-14 17:52:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:50,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:50,024 INFO L87 Difference]: Start difference. First operand 560 states and 812 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-14 17:52:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:50,200 INFO L93 Difference]: Finished difference Result 565 states and 812 transitions. [2024-10-14 17:52:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:52:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-10-14 17:52:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:50,203 INFO L225 Difference]: With dead ends: 565 [2024-10-14 17:52:50,203 INFO L226 Difference]: Without dead ends: 565 [2024-10-14 17:52:50,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:52:50,205 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 233 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:50,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 263 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-14 17:52:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 557. [2024-10-14 17:52:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 500 states have (on average 1.56) internal successors, (780), 541 states have internal predecessors, (780), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 17:52:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 804 transitions. [2024-10-14 17:52:50,219 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 804 transitions. Word has length 43 [2024-10-14 17:52:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:50,220 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 804 transitions. [2024-10-14 17:52:50,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-14 17:52:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 804 transitions. [2024-10-14 17:52:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:52:50,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:50,221 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] [2024-10-14 17:52:50,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 17:52:50,221 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -851884075, now seen corresponding path program 1 times [2024-10-14 17:52:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229519887] [2024-10-14 17:52:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:50,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229519887] [2024-10-14 17:52:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229519887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:50,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:52:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102618735] [2024-10-14 17:52:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:52:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:52:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:52:50,311 INFO L87 Difference]: Start difference. First operand 557 states and 804 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-14 17:52:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:50,366 INFO L93 Difference]: Finished difference Result 637 states and 898 transitions. [2024-10-14 17:52:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:52:50,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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 44 [2024-10-14 17:52:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:50,370 INFO L225 Difference]: With dead ends: 637 [2024-10-14 17:52:50,370 INFO L226 Difference]: Without dead ends: 637 [2024-10-14 17:52:50,370 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-14 17:52:50,371 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:50,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:52:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-14 17:52:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 563. [2024-10-14 17:52:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 506 states have (on average 1.5533596837944663) internal successors, (786), 547 states have internal predecessors, (786), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 17:52:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 810 transitions. [2024-10-14 17:52:50,381 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 810 transitions. Word has length 44 [2024-10-14 17:52:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:50,381 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 810 transitions. [2024-10-14 17:52:50,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-14 17:52:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 810 transitions. [2024-10-14 17:52:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:52:50,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:50,382 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] [2024-10-14 17:52:50,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 17:52:50,384 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1531942445, now seen corresponding path program 1 times [2024-10-14 17:52:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592543111] [2024-10-14 17:52:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592543111] [2024-10-14 17:52:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592543111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:52:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439261242] [2024-10-14 17:52:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:52:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:52:50,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:52:50,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:52:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:50,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:52:50,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:50,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:52:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:52:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439261242] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:52:50,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:52:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 17:52:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948487585] [2024-10-14 17:52:50,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:52:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:52:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:52:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:50,724 INFO L87 Difference]: Start difference. First operand 563 states and 810 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:52:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:50,874 INFO L93 Difference]: Finished difference Result 1979 states and 2834 transitions. [2024-10-14 17:52:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:52:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-10-14 17:52:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:50,881 INFO L225 Difference]: With dead ends: 1979 [2024-10-14 17:52:50,881 INFO L226 Difference]: Without dead ends: 1979 [2024-10-14 17:52:50,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:52:50,882 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 379 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:50,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 867 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2024-10-14 17:52:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1346. [2024-10-14 17:52:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1270 states have (on average 1.5401574803149607) internal successors, (1956), 1311 states have internal predecessors, (1956), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 17:52:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2018 transitions. [2024-10-14 17:52:50,913 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2018 transitions. Word has length 44 [2024-10-14 17:52:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:50,913 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2018 transitions. [2024-10-14 17:52:50,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:52:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2018 transitions. [2024-10-14 17:52:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:52:50,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:50,914 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] [2024-10-14 17:52:50,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:52:51,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-14 17:52:51,115 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:51,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1533789487, now seen corresponding path program 1 times [2024-10-14 17:52:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674169137] [2024-10-14 17:52:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674169137] [2024-10-14 17:52:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674169137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:52:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103067941] [2024-10-14 17:52:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:51,306 INFO L87 Difference]: Start difference. First operand 1346 states and 2018 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 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-14 17:52:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:51,461 INFO L93 Difference]: Finished difference Result 1369 states and 2041 transitions. [2024-10-14 17:52:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:52:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 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-14 17:52:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:51,466 INFO L225 Difference]: With dead ends: 1369 [2024-10-14 17:52:51,467 INFO L226 Difference]: Without dead ends: 1369 [2024-10-14 17:52:51,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:52:51,468 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:51,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 242 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-10-14 17:52:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1348. [2024-10-14 17:52:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1272 states have (on average 1.5400943396226414) internal successors, (1959), 1313 states have internal predecessors, (1959), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 17:52:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2021 transitions. [2024-10-14 17:52:51,497 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2021 transitions. Word has length 44 [2024-10-14 17:52:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:51,498 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2021 transitions. [2024-10-14 17:52:51,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 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-14 17:52:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2021 transitions. [2024-10-14 17:52:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:52:51,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:51,499 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] [2024-10-14 17:52:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 17:52:51,499 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:51,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1533789425, now seen corresponding path program 1 times [2024-10-14 17:52:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538501834] [2024-10-14 17:52:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:51,751 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-14 17:52:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538501834] [2024-10-14 17:52:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538501834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:52:51,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219669848] [2024-10-14 17:52:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:52:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:52:51,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:52:51,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:52:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:51,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:52:51,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:52:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:52,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:52:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219669848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:52,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:52:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 15 [2024-10-14 17:52:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107190149] [2024-10-14 17:52:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:52,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:52:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:52:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:52:52,340 INFO L87 Difference]: Start difference. First operand 1348 states and 2021 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 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-14 17:52:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:52,663 INFO L93 Difference]: Finished difference Result 1551 states and 2359 transitions. [2024-10-14 17:52:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:52:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 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-14 17:52:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:52,668 INFO L225 Difference]: With dead ends: 1551 [2024-10-14 17:52:52,668 INFO L226 Difference]: Without dead ends: 1551 [2024-10-14 17:52:52,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:52:52,669 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 340 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:52,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 502 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-14 17:52:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1345. [2024-10-14 17:52:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1270 states have (on average 1.5385826771653544) internal successors, (1954), 1310 states have internal predecessors, (1954), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 17:52:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2016 transitions. [2024-10-14 17:52:52,695 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2016 transitions. Word has length 44 [2024-10-14 17:52:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:52,695 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2016 transitions. [2024-10-14 17:52:52,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 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-14 17:52:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2016 transitions. [2024-10-14 17:52:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 17:52:52,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:52,696 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] [2024-10-14 17:52:52,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:52:52,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:52:52,897 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:52,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash -623672017, now seen corresponding path program 1 times [2024-10-14 17:52:52,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187679983] [2024-10-14 17:52:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 17:52:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:53,033 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-14 17:52:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187679983] [2024-10-14 17:52:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187679983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:53,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:53,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:52:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901066218] [2024-10-14 17:52:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:53,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:52:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:52:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:52:53,036 INFO L87 Difference]: Start difference. First operand 1345 states and 2016 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-14 17:52:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:53,125 INFO L93 Difference]: Finished difference Result 1364 states and 2033 transitions. [2024-10-14 17:52:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:52:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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 46 [2024-10-14 17:52:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:53,133 INFO L225 Difference]: With dead ends: 1364 [2024-10-14 17:52:53,133 INFO L226 Difference]: Without dead ends: 1364 [2024-10-14 17:52:53,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:52:53,134 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 114 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:53,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 428 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:52:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-10-14 17:52:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1344. [2024-10-14 17:52:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1270 states have (on average 1.536220472440945) internal successors, (1951), 1309 states have internal predecessors, (1951), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 17:52:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2013 transitions. [2024-10-14 17:52:53,157 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2013 transitions. Word has length 46 [2024-10-14 17:52:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:53,157 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2013 transitions. [2024-10-14 17:52:53,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-14 17:52:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2013 transitions. [2024-10-14 17:52:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 17:52:53,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:53,159 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] [2024-10-14 17:52:53,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 17:52:53,160 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash -797869352, now seen corresponding path program 1 times [2024-10-14 17:52:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066981391] [2024-10-14 17:52:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066981391] [2024-10-14 17:52:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066981391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 17:52:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051465456] [2024-10-14 17:52:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:52:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:52:53,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:52:53,927 INFO L87 Difference]: Start difference. First operand 1344 states and 2013 transitions. Second operand has 11 states, 11 states have (on average 4.0) 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-14 17:52:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:54,403 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2024-10-14 17:52:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:52:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) 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-14 17:52:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:54,408 INFO L225 Difference]: With dead ends: 1370 [2024-10-14 17:52:54,408 INFO L226 Difference]: Without dead ends: 1370 [2024-10-14 17:52:54,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:52:54,409 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 39 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:54,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 669 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-10-14 17:52:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2024-10-14 17:52:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1294 states have (on average 1.527047913446677) internal successors, (1976), 1333 states have internal predecessors, (1976), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 17:52:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2038 transitions. [2024-10-14 17:52:54,431 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2038 transitions. Word has length 46 [2024-10-14 17:52:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2038 transitions. [2024-10-14 17:52:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) 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-14 17:52:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2038 transitions. [2024-10-14 17:52:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 17:52:54,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:54,433 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] [2024-10-14 17:52:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 17:52:54,433 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1369035373, now seen corresponding path program 1 times [2024-10-14 17:52:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686021359] [2024-10-14 17:52:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686021359] [2024-10-14 17:52:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686021359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 17:52:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882410608] [2024-10-14 17:52:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:52:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:52:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:52:55,063 INFO L87 Difference]: Start difference. First operand 1368 states and 2038 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:55,518 INFO L93 Difference]: Finished difference Result 2483 states and 3780 transitions. [2024-10-14 17:52:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:52:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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 47 [2024-10-14 17:52:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:55,527 INFO L225 Difference]: With dead ends: 2483 [2024-10-14 17:52:55,527 INFO L226 Difference]: Without dead ends: 2483 [2024-10-14 17:52:55,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:52:55,528 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 317 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:55,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 873 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:52:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-14 17:52:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1846. [2024-10-14 17:52:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1748 states have (on average 1.5280320366132722) internal successors, (2671), 1804 states have internal predecessors, (2671), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 36 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 17:52:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2779 transitions. [2024-10-14 17:52:55,569 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2779 transitions. Word has length 47 [2024-10-14 17:52:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:55,570 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2779 transitions. [2024-10-14 17:52:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2779 transitions. [2024-10-14 17:52:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 17:52:55,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:55,571 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] [2024-10-14 17:52:55,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 17:52:55,571 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1369035372, now seen corresponding path program 1 times [2024-10-14 17:52:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606833275] [2024-10-14 17:52:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606833275] [2024-10-14 17:52:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606833275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:56,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 17:52:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507443833] [2024-10-14 17:52:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:52:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:52:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:52:56,386 INFO L87 Difference]: Start difference. First operand 1846 states and 2779 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:57,028 INFO L93 Difference]: Finished difference Result 2603 states and 3968 transitions. [2024-10-14 17:52:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:52:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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 47 [2024-10-14 17:52:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:57,038 INFO L225 Difference]: With dead ends: 2603 [2024-10-14 17:52:57,038 INFO L226 Difference]: Without dead ends: 2603 [2024-10-14 17:52:57,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:52:57,039 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 352 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:57,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1046 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:52:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-10-14 17:52:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1965. [2024-10-14 17:52:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1861 states have (on average 1.5325094035464804) internal successors, (2852), 1919 states have internal predecessors, (2852), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 39 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 17:52:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2970 transitions. [2024-10-14 17:52:57,071 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2970 transitions. Word has length 47 [2024-10-14 17:52:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2970 transitions. [2024-10-14 17:52:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2970 transitions. [2024-10-14 17:52:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 17:52:57,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:57,074 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] [2024-10-14 17:52:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 17:52:57,074 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1368975791, now seen corresponding path program 1 times [2024-10-14 17:52:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909124718] [2024-10-14 17:52:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:57,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:57,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909124718] [2024-10-14 17:52:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909124718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:52:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773482906] [2024-10-14 17:52:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:52:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:52:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:52:57,382 INFO L87 Difference]: Start difference. First operand 1965 states and 2970 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:57,658 INFO L93 Difference]: Finished difference Result 2951 states and 4478 transitions. [2024-10-14 17:52:57,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:52:57,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 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 47 [2024-10-14 17:52:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:57,668 INFO L225 Difference]: With dead ends: 2951 [2024-10-14 17:52:57,668 INFO L226 Difference]: Without dead ends: 2951 [2024-10-14 17:52:57,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:52:57,669 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 179 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:57,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 623 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:52:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-10-14 17:52:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2369. [2024-10-14 17:52:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2217 states have (on average 1.498872350022553) internal successors, (3323), 2309 states have internal predecessors, (3323), 103 states have call successors, (103), 10 states have call predecessors, (103), 10 states have return successors, (103), 49 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-14 17:52:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3529 transitions. [2024-10-14 17:52:57,714 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3529 transitions. Word has length 47 [2024-10-14 17:52:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:57,715 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3529 transitions. [2024-10-14 17:52:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3529 transitions. [2024-10-14 17:52:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 17:52:57,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:57,716 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] [2024-10-14 17:52:57,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 17:52:57,716 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:57,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1368975790, now seen corresponding path program 1 times [2024-10-14 17:52:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997204801] [2024-10-14 17:52:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:58,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997204801] [2024-10-14 17:52:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997204801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 17:52:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057068452] [2024-10-14 17:52:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:58,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:52:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:52:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:52:58,315 INFO L87 Difference]: Start difference. First operand 2369 states and 3529 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:58,776 INFO L93 Difference]: Finished difference Result 2531 states and 3732 transitions. [2024-10-14 17:52:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:52:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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 47 [2024-10-14 17:52:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:58,791 INFO L225 Difference]: With dead ends: 2531 [2024-10-14 17:52:58,791 INFO L226 Difference]: Without dead ends: 2531 [2024-10-14 17:52:58,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-10-14 17:52:58,792 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 162 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:58,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 767 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:52:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-14 17:52:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2390. [2024-10-14 17:52:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2239 states have (on average 1.492184010719071) internal successors, (3341), 2330 states have internal predecessors, (3341), 102 states have call successors, (102), 10 states have call predecessors, (102), 10 states have return successors, (102), 49 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 17:52:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3545 transitions. [2024-10-14 17:52:58,830 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3545 transitions. Word has length 47 [2024-10-14 17:52:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3545 transitions. [2024-10-14 17:52:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 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-14 17:52:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3545 transitions. [2024-10-14 17:52:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:52:58,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:58,832 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-14 17:52:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 17:52:58,832 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash -265052112, now seen corresponding path program 1 times [2024-10-14 17:52:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95649471] [2024-10-14 17:52:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:52:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:52:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:52:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:52:59,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95649471] [2024-10-14 17:52:59,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95649471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:52:59,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:52:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 17:52:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582837685] [2024-10-14 17:52:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:52:59,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:52:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:52:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:52:59,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:52:59,419 INFO L87 Difference]: Start difference. First operand 2390 states and 3545 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:52:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:52:59,896 INFO L93 Difference]: Finished difference Result 3476 states and 5187 transitions. [2024-10-14 17:52:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:52:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 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 48 [2024-10-14 17:52:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:52:59,904 INFO L225 Difference]: With dead ends: 3476 [2024-10-14 17:52:59,904 INFO L226 Difference]: Without dead ends: 3476 [2024-10-14 17:52:59,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:52:59,905 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 358 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:52:59,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1065 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:52:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-10-14 17:52:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 2866. [2024-10-14 17:52:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2667 states have (on average 1.4653168353955754) internal successors, (3908), 2792 states have internal predecessors, (3908), 146 states have call successors, (146), 14 states have call predecessors, (146), 14 states have return successors, (146), 59 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-14 17:52:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4200 transitions. [2024-10-14 17:52:59,945 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4200 transitions. Word has length 48 [2024-10-14 17:52:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:52:59,946 INFO L471 AbstractCegarLoop]: Abstraction has 2866 states and 4200 transitions. [2024-10-14 17:52:59,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:52:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4200 transitions. [2024-10-14 17:52:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:52:59,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:52:59,947 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-14 17:52:59,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 17:52:59,947 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:52:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:52:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash -265052111, now seen corresponding path program 1 times [2024-10-14 17:52:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:52:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630152473] [2024-10-14 17:52:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:52:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:52:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:53:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:00,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:53:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630152473] [2024-10-14 17:53:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630152473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:00,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:00,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 17:53:00,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547288982] [2024-10-14 17:53:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:00,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:53:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:53:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:53:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:53:00,807 INFO L87 Difference]: Start difference. First operand 2866 states and 4200 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:53:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:01,361 INFO L93 Difference]: Finished difference Result 3565 states and 5320 transitions. [2024-10-14 17:53:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:53:01,363 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 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 48 [2024-10-14 17:53:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:01,376 INFO L225 Difference]: With dead ends: 3565 [2024-10-14 17:53:01,376 INFO L226 Difference]: Without dead ends: 3565 [2024-10-14 17:53:01,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:53:01,377 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 376 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:01,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1153 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:53:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2024-10-14 17:53:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 2558. [2024-10-14 17:53:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2393 states have (on average 1.4780610112829085) internal successors, (3537), 2494 states have internal predecessors, (3537), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 52 states have call predecessors, (115), 115 states have call successors, (115) [2024-10-14 17:53:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3767 transitions. [2024-10-14 17:53:01,417 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3767 transitions. Word has length 48 [2024-10-14 17:53:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:01,417 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3767 transitions. [2024-10-14 17:53:01,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:53:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3767 transitions. [2024-10-14 17:53:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:53:01,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:01,418 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-14 17:53:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 17:53:01,419 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:53:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -264992529, now seen corresponding path program 1 times [2024-10-14 17:53:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:53:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320298150] [2024-10-14 17:53:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:53:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:53:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:02,453 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-14 17:53:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:53:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320298150] [2024-10-14 17:53:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320298150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:53:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499626494] [2024-10-14 17:53:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:53:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:53:02,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:53:02,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:53:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:02,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 17:53:02,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:02,939 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-14 17:53:02,945 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-14 17:53:03,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:53:03,261 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 29 treesize of output 17 [2024-10-14 17:53:03,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:53:03,267 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 32 treesize of output 14 [2024-10-14 17:53:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:53:03,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:53:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499626494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:53:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 22 [2024-10-14 17:53:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291680683] [2024-10-14 17:53:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:53:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:53:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:53:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:53:03,304 INFO L87 Difference]: Start difference. First operand 2558 states and 3767 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:53:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:03,661 INFO L93 Difference]: Finished difference Result 3269 states and 4778 transitions. [2024-10-14 17:53:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:53:03,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 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 48 [2024-10-14 17:53:03,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:03,666 INFO L225 Difference]: With dead ends: 3269 [2024-10-14 17:53:03,666 INFO L226 Difference]: Without dead ends: 3269 [2024-10-14 17:53:03,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:53:03,667 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 198 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:03,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 698 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:53:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2024-10-14 17:53:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3160. [2024-10-14 17:53:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 2949 states have (on average 1.4764326890471346) internal successors, (4354), 3078 states have internal predecessors, (4354), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 65 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-14 17:53:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4666 transitions. [2024-10-14 17:53:03,708 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4666 transitions. Word has length 48 [2024-10-14 17:53:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:03,708 INFO L471 AbstractCegarLoop]: Abstraction has 3160 states and 4666 transitions. [2024-10-14 17:53:03,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 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-14 17:53:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4666 transitions. [2024-10-14 17:53:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:53:03,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:03,709 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-14 17:53:03,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:53:03,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:53:03,910 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:53:03,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1478469438, now seen corresponding path program 1 times [2024-10-14 17:53:03,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:53:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994673127] [2024-10-14 17:53:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:53:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:53:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 17:53:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:53:04,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:53:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994673127] [2024-10-14 17:53:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994673127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:53:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:53:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 17:53:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157498873] [2024-10-14 17:53:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:53:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:53:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:53:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:53:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:53:04,359 INFO L87 Difference]: Start difference. First operand 3160 states and 4666 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-14 17:53:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:53:04,699 INFO L93 Difference]: Finished difference Result 3711 states and 5522 transitions. [2024-10-14 17:53:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:53:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2024-10-14 17:53:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:53:04,706 INFO L225 Difference]: With dead ends: 3711 [2024-10-14 17:53:04,706 INFO L226 Difference]: Without dead ends: 3711 [2024-10-14 17:53:04,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:53:04,707 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 137 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:53:04,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1002 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:53:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2024-10-14 17:53:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3124. [2024-10-14 17:53:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2913 states have (on average 1.4685890834191555) internal successors, (4278), 3042 states have internal predecessors, (4278), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 65 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-14 17:53:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4590 transitions. [2024-10-14 17:53:04,749 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4590 transitions. Word has length 49 [2024-10-14 17:53:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:53:04,749 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4590 transitions. [2024-10-14 17:53:04,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-14 17:53:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4590 transitions. [2024-10-14 17:53:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:53:04,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:53:04,750 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-14 17:53:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 17:53:04,750 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-14 17:53:04,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:53:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1338710335, now seen corresponding path program 1 times [2024-10-14 17:53:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:53:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440395682] [2024-10-14 17:53:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:53:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 17:53:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 17:53:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:53:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:53:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440395682] [2024-10-14 17:53:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440395682] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:53:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096999031] [2024-10-14 17:53:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:53:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:53:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:53:05,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:53:05,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:53:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:53:05,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 17:53:05,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:53:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:53:05,906 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-14 17:53:05,945 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-14 17:53:06,023 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2024-10-14 17:53:06,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-10-14 17:53:10,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:53:10,224 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-14 17:53:10,241 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-14 17:53:10,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:53:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096999031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:53:10,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:53:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2024-10-14 17:53:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063269283] [2024-10-14 17:53:10,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:53:10,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 17:53:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:53:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 17:53:10,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=570, Unknown=1, NotChecked=0, Total=650 [2024-10-14 17:53:10,350 INFO L87 Difference]: Start difference. First operand 3124 states and 4590 transitions. Second operand has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 20 states have internal predecessors, (87), 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-14 17:53:18,742 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-14 17:53:26,819 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-14 17:53:30,827 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-14 17:53:34,846 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-14 17:53:38,854 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-14 17:53:42,863 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-14 17:53:46,881 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-14 17:53:50,886 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-14 17:53:54,893 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]