./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:56:56,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:56:56,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:56:56,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:56:56,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:56:56,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:56:56,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:56:56,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:56:56,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:56:56,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:56:56,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:56:56,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:56:56,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:56:56,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:56:56,584 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:56:56,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:56:56,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:56:56,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:56:56,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:56:56,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:56:56,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:56:56,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:56:56,588 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:56:56,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:56:56,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:56:56,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:56:56,589 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:56:56,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:56:56,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:56:56,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:56:56,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:56:56,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:56,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:56:56,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:56:56,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:56:56,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:56:56,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2024-10-11 17:56:56,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:56:56,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:56:56,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:56:56,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:56:56,850 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:56:56,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2024-10-11 17:56:58,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:56:58,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:56:58,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2024-10-11 17:56:58,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6eb6a2ee/b35055d1dd4c44cba09827650fa2cf73/FLAGc8f23237c [2024-10-11 17:56:58,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6eb6a2ee/b35055d1dd4c44cba09827650fa2cf73 [2024-10-11 17:56:58,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:56:58,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:56:58,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:58,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:56:58,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:56:58,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dbd7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58, skipping insertion in model container [2024-10-11 17:56:58,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:56:58,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:58,770 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:56:58,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:58,832 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:56:58,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58 WrapperNode [2024-10-11 17:56:58,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:58,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:58,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:56:58,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:56:58,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,885 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 213 [2024-10-11 17:56:58,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:58,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:56:58,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:56:58,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:56:58,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,926 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-11 17:56:58,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:56:58,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:56:58,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:56:58,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:56:58,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (1/1) ... [2024-10-11 17:56:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:58,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:56:59,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:56:59,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:56:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-11 17:56:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:56:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:56:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:56:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:56:59,131 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:56:59,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:56:59,452 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2024-10-11 17:56:59,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:56:59,496 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:56:59,496 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 17:56:59,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:59 BoogieIcfgContainer [2024-10-11 17:56:59,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:56:59,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:56:59,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:56:59,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:56:59,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:58" (1/3) ... [2024-10-11 17:56:59,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4122a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:59, skipping insertion in model container [2024-10-11 17:56:59,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:58" (2/3) ... [2024-10-11 17:56:59,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4122a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:59, skipping insertion in model container [2024-10-11 17:56:59,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:59" (3/3) ... [2024-10-11 17:56:59,503 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217.i [2024-10-11 17:56:59,516 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:56:59,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-11 17:56:59,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:56:59,556 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;@7cf39236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:56:59,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-10-11 17:56:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 77 states have (on average 2.1948051948051948) internal successors, (169), 144 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:56:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:56:59,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:59,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:56:59,569 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-11 17:56:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 326466752, now seen corresponding path program 1 times [2024-10-11 17:56:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419839341] [2024-10-11 17:56:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:59,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419839341] [2024-10-11 17:56:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419839341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239737482] [2024-10-11 17:56:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:56:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:56:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:56:59,712 INFO L87 Difference]: Start difference. First operand has 148 states, 77 states have (on average 2.1948051948051948) internal successors, (169), 144 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:59,776 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-10-11 17:56:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:56:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:56:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:59,787 INFO L225 Difference]: With dead ends: 148 [2024-10-11 17:56:59,787 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 17:56:59,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:56:59,793 INFO L432 NwaCegarLoop]: 149 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, 149 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-11 17:56:59,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 17:56:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 17:56:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 77 states have (on average 2.103896103896104) internal successors, (162), 143 states have internal predecessors, (162), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:56:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2024-10-11 17:56:59,827 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 5 [2024-10-11 17:56:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2024-10-11 17:56:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2024-10-11 17:56:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:56:59,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:59,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:56:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:56:59,829 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-11 17:56:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1299860234, now seen corresponding path program 1 times [2024-10-11 17:56:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676660259] [2024-10-11 17:56:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:59,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676660259] [2024-10-11 17:56:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676660259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:56:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387396940] [2024-10-11 17:56:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:59,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:59,955 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:00,159 INFO L93 Difference]: Finished difference Result 287 states and 324 transitions. [2024-10-11 17:57:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:57:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:00,162 INFO L225 Difference]: With dead ends: 287 [2024-10-11 17:57:00,162 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 17:57:00,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:00,166 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 149 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 196 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-11 17:57:00,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 196 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 17:57:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2024-10-11 17:57:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 2.0793650793650795) internal successors, (262), 192 states have internal predecessors, (262), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:57:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2024-10-11 17:57:00,195 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 6 [2024-10-11 17:57:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:00,196 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2024-10-11 17:57:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2024-10-11 17:57:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:57:00,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:00,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:57:00,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:57:00,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:00,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1299860235, now seen corresponding path program 1 times [2024-10-11 17:57:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:00,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103405988] [2024-10-11 17:57:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103405988] [2024-10-11 17:57:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103405988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166041537] [2024-10-11 17:57:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:00,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:00,356 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:00,492 INFO L93 Difference]: Finished difference Result 312 states and 406 transitions. [2024-10-11 17:57:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:57:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:00,494 INFO L225 Difference]: With dead ends: 312 [2024-10-11 17:57:00,494 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 17:57:00,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:00,495 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:00,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 295 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 17:57:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 263. [2024-10-11 17:57:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 184 states have (on average 2.010869565217391) internal successors, (370), 252 states have internal predecessors, (370), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:57:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2024-10-11 17:57:00,507 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 6 [2024-10-11 17:57:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:00,507 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2024-10-11 17:57:00,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2024-10-11 17:57:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:57:00,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:00,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:57:00,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:57:00,508 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-11 17:57:00,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1299860297, now seen corresponding path program 1 times [2024-10-11 17:57:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:00,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4785041] [2024-10-11 17:57:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4785041] [2024-10-11 17:57:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4785041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:00,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336454012] [2024-10-11 17:57:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:00,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:00,562 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:00,670 INFO L93 Difference]: Finished difference Result 311 states and 404 transitions. [2024-10-11 17:57:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:00,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:57:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:00,671 INFO L225 Difference]: With dead ends: 311 [2024-10-11 17:57:00,671 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 17:57:00,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:00,672 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 92 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:00,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 296 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 17:57:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 263. [2024-10-11 17:57:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 184 states have (on average 2.010869565217391) internal successors, (370), 252 states have internal predecessors, (370), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:57:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2024-10-11 17:57:00,681 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 6 [2024-10-11 17:57:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:00,681 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2024-10-11 17:57:00,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2024-10-11 17:57:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:00,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:00,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:00,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:57:00,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash -669739456, now seen corresponding path program 1 times [2024-10-11 17:57:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839140366] [2024-10-11 17:57:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839140366] [2024-10-11 17:57:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839140366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:00,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864817213] [2024-10-11 17:57:00,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:00,758 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:00,875 INFO L93 Difference]: Finished difference Result 390 states and 545 transitions. [2024-10-11 17:57:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:00,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:57:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:00,881 INFO L225 Difference]: With dead ends: 390 [2024-10-11 17:57:00,882 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 17:57:00,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:00,883 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 117 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:00,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 521 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 17:57:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 300. [2024-10-11 17:57:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 218 states have (on average 1.981651376146789) internal successors, (432), 287 states have internal predecessors, (432), 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-11 17:57:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 452 transitions. [2024-10-11 17:57:00,891 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 452 transitions. Word has length 8 [2024-10-11 17:57:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 452 transitions. [2024-10-11 17:57:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 452 transitions. [2024-10-11 17:57:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:00,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:00,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:00,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:57:00,893 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-11 17:57:00,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash -669679874, now seen corresponding path program 1 times [2024-10-11 17:57:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635630088] [2024-10-11 17:57:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635630088] [2024-10-11 17:57:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635630088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456603984] [2024-10-11 17:57:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:00,946 INFO L87 Difference]: Start difference. First operand 300 states and 452 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:01,071 INFO L93 Difference]: Finished difference Result 381 states and 535 transitions. [2024-10-11 17:57:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:57:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:01,073 INFO L225 Difference]: With dead ends: 381 [2024-10-11 17:57:01,073 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 17:57:01,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:01,074 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 105 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:01,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 523 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 17:57:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 299. [2024-10-11 17:57:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 217 states have (on average 1.9861751152073732) internal successors, (431), 286 states have internal predecessors, (431), 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-11 17:57:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 451 transitions. [2024-10-11 17:57:01,091 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 451 transitions. Word has length 8 [2024-10-11 17:57:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:01,091 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 451 transitions. [2024-10-11 17:57:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 451 transitions. [2024-10-11 17:57:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:57:01,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:01,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:01,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:57:01,093 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-11 17:57:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 712912086, now seen corresponding path program 1 times [2024-10-11 17:57:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132400202] [2024-10-11 17:57:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,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-11 17:57:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132400202] [2024-10-11 17:57:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132400202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:01,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:57:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004342431] [2024-10-11 17:57:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:01,144 INFO L87 Difference]: Start difference. First operand 299 states and 451 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:01,248 INFO L93 Difference]: Finished difference Result 347 states and 495 transitions. [2024-10-11 17:57:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:57:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:01,251 INFO L225 Difference]: With dead ends: 347 [2024-10-11 17:57:01,251 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 17:57:01,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:01,253 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 59 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:01,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 224 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 17:57:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 296. [2024-10-11 17:57:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 214 states have (on average 1.9906542056074767) internal successors, (426), 283 states have internal predecessors, (426), 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-11 17:57:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 446 transitions. [2024-10-11 17:57:01,261 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 446 transitions. Word has length 9 [2024-10-11 17:57:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 446 transitions. [2024-10-11 17:57:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 446 transitions. [2024-10-11 17:57:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:57:01,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:01,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:57:01,263 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-11 17:57:01,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 895737773, now seen corresponding path program 1 times [2024-10-11 17:57:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595876930] [2024-10-11 17:57:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595876930] [2024-10-11 17:57:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595876930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286934593] [2024-10-11 17:57:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:01,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:01,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:01,308 INFO L87 Difference]: Start difference. First operand 296 states and 446 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:01,471 INFO L93 Difference]: Finished difference Result 398 states and 535 transitions. [2024-10-11 17:57:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 17:57:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:01,473 INFO L225 Difference]: With dead ends: 398 [2024-10-11 17:57:01,473 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 17:57:01,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:01,474 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 150 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 283 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:01,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 283 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 17:57:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 302. [2024-10-11 17:57:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 220 states have (on average 1.9636363636363636) internal successors, (432), 289 states have internal predecessors, (432), 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-11 17:57:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 452 transitions. [2024-10-11 17:57:01,481 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 452 transitions. Word has length 14 [2024-10-11 17:57:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:01,481 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 452 transitions. [2024-10-11 17:57:01,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 452 transitions. [2024-10-11 17:57:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:57:01,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:01,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:57:01,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:01,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash 895737774, now seen corresponding path program 1 times [2024-10-11 17:57:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:01,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037161724] [2024-10-11 17:57:01,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037161724] [2024-10-11 17:57:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037161724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982013987] [2024-10-11 17:57:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:01,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:01,550 INFO L87 Difference]: Start difference. First operand 302 states and 452 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:01,681 INFO L93 Difference]: Finished difference Result 346 states and 460 transitions. [2024-10-11 17:57:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 17:57:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:01,683 INFO L225 Difference]: With dead ends: 346 [2024-10-11 17:57:01,684 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 17:57:01,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:01,684 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 90 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:01,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 359 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 17:57:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 302. [2024-10-11 17:57:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 220 states have (on average 1.9227272727272726) internal successors, (423), 289 states have internal predecessors, (423), 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-11 17:57:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 443 transitions. [2024-10-11 17:57:01,690 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 443 transitions. Word has length 14 [2024-10-11 17:57:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 443 transitions. [2024-10-11 17:57:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 443 transitions. [2024-10-11 17:57:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:01,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:01,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:57:01,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1806038072, now seen corresponding path program 1 times [2024-10-11 17:57:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973822423] [2024-10-11 17:57:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973822423] [2024-10-11 17:57:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973822423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133654732] [2024-10-11 17:57:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:01,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:01,778 INFO L87 Difference]: Start difference. First operand 302 states and 443 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:01,982 INFO L93 Difference]: Finished difference Result 408 states and 550 transitions. [2024-10-11 17:57:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:57:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:01,984 INFO L225 Difference]: With dead ends: 408 [2024-10-11 17:57:01,984 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 17:57:01,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:01,985 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 292 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 270 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-11 17:57:01,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 270 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 17:57:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 299. [2024-10-11 17:57:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 221 states have (on average 1.8868778280542986) internal successors, (417), 286 states have internal predecessors, (417), 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-11 17:57:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 437 transitions. [2024-10-11 17:57:01,992 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 437 transitions. Word has length 16 [2024-10-11 17:57:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:01,992 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 437 transitions. [2024-10-11 17:57:01,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 437 transitions. [2024-10-11 17:57:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:01,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:01,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:01,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:57:01,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:01,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1806038073, now seen corresponding path program 1 times [2024-10-11 17:57:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23520626] [2024-10-11 17:57:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23520626] [2024-10-11 17:57:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23520626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869851516] [2024-10-11 17:57:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:02,162 INFO L87 Difference]: Start difference. First operand 299 states and 437 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:02,580 INFO L93 Difference]: Finished difference Result 436 states and 577 transitions. [2024-10-11 17:57:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:57:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:02,584 INFO L225 Difference]: With dead ends: 436 [2024-10-11 17:57:02,584 INFO L226 Difference]: Without dead ends: 436 [2024-10-11 17:57:02,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-11 17:57:02,585 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 246 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:02,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 360 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-11 17:57:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 326. [2024-10-11 17:57:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 246 states have (on average 1.8739837398373984) internal successors, (461), 312 states have internal predecessors, (461), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-11 17:57:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 485 transitions. [2024-10-11 17:57:02,594 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 485 transitions. Word has length 16 [2024-10-11 17:57:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:02,594 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 485 transitions. [2024-10-11 17:57:02,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 485 transitions. [2024-10-11 17:57:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:02,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:02,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:57:02,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1416390, now seen corresponding path program 1 times [2024-10-11 17:57:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372799976] [2024-10-11 17:57:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372799976] [2024-10-11 17:57:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372799976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593979541] [2024-10-11 17:57:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:02,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:02,674 INFO L87 Difference]: Start difference. First operand 326 states and 485 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:02,767 INFO L93 Difference]: Finished difference Result 336 states and 497 transitions. [2024-10-11 17:57:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:57:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:02,769 INFO L225 Difference]: With dead ends: 336 [2024-10-11 17:57:02,769 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 17:57:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:02,769 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:02,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 729 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 17:57:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-10-11 17:57:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 253 states have (on average 1.8458498023715415) internal successors, (467), 321 states have internal predecessors, (467), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 497 transitions. [2024-10-11 17:57:02,776 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 497 transitions. Word has length 16 [2024-10-11 17:57:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 497 transitions. [2024-10-11 17:57:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 497 transitions. [2024-10-11 17:57:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:57:02,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:02,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:57:02,777 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-11 17:57:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -43852513, now seen corresponding path program 1 times [2024-10-11 17:57:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431340397] [2024-10-11 17:57:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431340397] [2024-10-11 17:57:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431340397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113904062] [2024-10-11 17:57:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:03,034 INFO L87 Difference]: Start difference. First operand 336 states and 497 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:03,838 INFO L93 Difference]: Finished difference Result 456 states and 612 transitions. [2024-10-11 17:57:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:03,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 17:57:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:03,840 INFO L225 Difference]: With dead ends: 456 [2024-10-11 17:57:03,840 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 17:57:03,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:03,840 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 213 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:03,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 498 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:57:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 17:57:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 333. [2024-10-11 17:57:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 250 states have (on average 1.848) internal successors, (462), 318 states have internal predecessors, (462), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 492 transitions. [2024-10-11 17:57:03,847 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 492 transitions. Word has length 17 [2024-10-11 17:57:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:03,847 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 492 transitions. [2024-10-11 17:57:03,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 492 transitions. [2024-10-11 17:57:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:57:03,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:03,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:03,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:57:03,848 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-11 17:57:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 608544403, now seen corresponding path program 1 times [2024-10-11 17:57:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141039523] [2024-10-11 17:57:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141039523] [2024-10-11 17:57:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141039523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325987870] [2024-10-11 17:57:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:04,039 INFO L87 Difference]: Start difference. First operand 333 states and 492 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,404 INFO L93 Difference]: Finished difference Result 415 states and 580 transitions. [2024-10-11 17:57:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 17:57:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,409 INFO L225 Difference]: With dead ends: 415 [2024-10-11 17:57:04,409 INFO L226 Difference]: Without dead ends: 415 [2024-10-11 17:57:04,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:04,410 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 91 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:04,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 649 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-11 17:57:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 327. [2024-10-11 17:57:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 244 states have (on average 1.848360655737705) internal successors, (451), 312 states have internal predecessors, (451), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 481 transitions. [2024-10-11 17:57:04,416 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 481 transitions. Word has length 18 [2024-10-11 17:57:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,416 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 481 transitions. [2024-10-11 17:57:04,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 481 transitions. [2024-10-11 17:57:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:04,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:57:04,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:04,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1685373121, now seen corresponding path program 1 times [2024-10-11 17:57:04,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708188221] [2024-10-11 17:57:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708188221] [2024-10-11 17:57:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708188221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621769219] [2024-10-11 17:57:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:04,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:04,467 INFO L87 Difference]: Start difference. First operand 327 states and 481 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,664 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2024-10-11 17:57:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 17:57:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,665 INFO L225 Difference]: With dead ends: 330 [2024-10-11 17:57:04,665 INFO L226 Difference]: Without dead ends: 330 [2024-10-11 17:57:04,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:04,666 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 26 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 389 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:04,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 389 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-11 17:57:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 324. [2024-10-11 17:57:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.7813765182186234) internal successors, (440), 309 states have internal predecessors, (440), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2024-10-11 17:57:04,675 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 19 [2024-10-11 17:57:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,675 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2024-10-11 17:57:04,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2024-10-11 17:57:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:04,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:57:04,676 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1685373122, now seen corresponding path program 1 times [2024-10-11 17:57:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903533486] [2024-10-11 17:57:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903533486] [2024-10-11 17:57:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903533486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643905126] [2024-10-11 17:57:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:04,785 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:04,961 INFO L93 Difference]: Finished difference Result 361 states and 482 transitions. [2024-10-11 17:57:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 17:57:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:04,963 INFO L225 Difference]: With dead ends: 361 [2024-10-11 17:57:04,963 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 17:57:04,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:04,963 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 101 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:04,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 338 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 17:57:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 324. [2024-10-11 17:57:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.7530364372469636) internal successors, (433), 309 states have internal predecessors, (433), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 463 transitions. [2024-10-11 17:57:04,969 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 463 transitions. Word has length 19 [2024-10-11 17:57:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:04,969 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 463 transitions. [2024-10-11 17:57:04,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 463 transitions. [2024-10-11 17:57:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:04,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:04,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:04,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:57:04,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:04,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash 632303953, now seen corresponding path program 1 times [2024-10-11 17:57:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666735645] [2024-10-11 17:57:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666735645] [2024-10-11 17:57:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666735645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387285621] [2024-10-11 17:57:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:05,145 INFO L87 Difference]: Start difference. First operand 324 states and 463 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,393 INFO L93 Difference]: Finished difference Result 423 states and 590 transitions. [2024-10-11 17:57:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 17:57:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,395 INFO L225 Difference]: With dead ends: 423 [2024-10-11 17:57:05,395 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 17:57:05,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:05,396 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 126 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:05,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 614 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 17:57:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 338. [2024-10-11 17:57:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 261 states have (on average 1.7279693486590038) internal successors, (451), 321 states have internal predecessors, (451), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 481 transitions. [2024-10-11 17:57:05,402 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 481 transitions. Word has length 19 [2024-10-11 17:57:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,402 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 481 transitions. [2024-10-11 17:57:05,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-10-11 17:57:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:05,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:57:05,403 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -439365590, now seen corresponding path program 1 times [2024-10-11 17:57:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665973379] [2024-10-11 17:57:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665973379] [2024-10-11 17:57:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665973379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277491616] [2024-10-11 17:57:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:05,453 INFO L87 Difference]: Start difference. First operand 338 states and 481 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-11 17:57:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,520 INFO L93 Difference]: Finished difference Result 409 states and 593 transitions. [2024-10-11 17:57:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-11 17:57:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,522 INFO L225 Difference]: With dead ends: 409 [2024-10-11 17:57:05,522 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 17:57:05,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:05,522 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 42 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 689 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 17:57:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 338. [2024-10-11 17:57:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 261 states have (on average 1.7126436781609196) internal successors, (447), 321 states have internal predecessors, (447), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2024-10-11 17:57:05,531 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 20 [2024-10-11 17:57:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2024-10-11 17:57:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-11 17:57:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2024-10-11 17:57:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:05,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:57:05,533 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:05,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash -732768597, now seen corresponding path program 1 times [2024-10-11 17:57:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831585189] [2024-10-11 17:57:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831585189] [2024-10-11 17:57:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831585189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891676784] [2024-10-11 17:57:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:05,682 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:05,917 INFO L93 Difference]: Finished difference Result 449 states and 622 transitions. [2024-10-11 17:57:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:05,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 17:57:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:05,919 INFO L225 Difference]: With dead ends: 449 [2024-10-11 17:57:05,919 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 17:57:05,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:05,920 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 117 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:05,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 744 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 17:57:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 348. [2024-10-11 17:57:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 271 states have (on average 1.6937269372693726) internal successors, (459), 329 states have internal predecessors, (459), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 489 transitions. [2024-10-11 17:57:05,926 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 489 transitions. Word has length 20 [2024-10-11 17:57:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:05,926 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 489 transitions. [2024-10-11 17:57:05,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 489 transitions. [2024-10-11 17:57:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:05,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:05,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:05,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:57:05,927 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:05,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash -675510295, now seen corresponding path program 1 times [2024-10-11 17:57:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444872679] [2024-10-11 17:57:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444872679] [2024-10-11 17:57:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444872679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:05,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:05,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544454388] [2024-10-11 17:57:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:05,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:05,989 INFO L87 Difference]: Start difference. First operand 348 states and 489 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-11 17:57:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,064 INFO L93 Difference]: Finished difference Result 348 states and 485 transitions. [2024-10-11 17:57:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-11 17:57:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,065 INFO L225 Difference]: With dead ends: 348 [2024-10-11 17:57:06,069 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 17:57:06,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:06,070 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 17:57:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-11 17:57:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 271 states have (on average 1.6789667896678966) internal successors, (455), 329 states have internal predecessors, (455), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 485 transitions. [2024-10-11 17:57:06,078 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 485 transitions. Word has length 20 [2024-10-11 17:57:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,078 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 485 transitions. [2024-10-11 17:57:06,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-11 17:57:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2024-10-11 17:57:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:06,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:57:06,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 783127179, now seen corresponding path program 1 times [2024-10-11 17:57:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762977940] [2024-10-11 17:57:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:06,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762977940] [2024-10-11 17:57:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762977940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437535582] [2024-10-11 17:57:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:06,203 INFO L87 Difference]: Start difference. First operand 348 states and 485 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,320 INFO L93 Difference]: Finished difference Result 437 states and 606 transitions. [2024-10-11 17:57:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:57:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,322 INFO L225 Difference]: With dead ends: 437 [2024-10-11 17:57:06,322 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 17:57:06,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-11 17:57:06,322 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 227 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 499 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 17:57:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 408. [2024-10-11 17:57:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 331 states have (on average 1.6646525679758308) internal successors, (551), 384 states have internal predecessors, (551), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 581 transitions. [2024-10-11 17:57:06,329 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 581 transitions. Word has length 22 [2024-10-11 17:57:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,329 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 581 transitions. [2024-10-11 17:57:06,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 581 transitions. [2024-10-11 17:57:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:06,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:57:06,330 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash 489724172, now seen corresponding path program 1 times [2024-10-11 17:57:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964626709] [2024-10-11 17:57:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964626709] [2024-10-11 17:57:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964626709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:06,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635817293] [2024-10-11 17:57:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:06,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:06,399 INFO L87 Difference]: Start difference. First operand 408 states and 581 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,553 INFO L93 Difference]: Finished difference Result 434 states and 601 transitions. [2024-10-11 17:57:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:06,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:57:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,554 INFO L225 Difference]: With dead ends: 434 [2024-10-11 17:57:06,555 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 17:57:06,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:06,555 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 170 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 693 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 17:57:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 345. [2024-10-11 17:57:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 271 states have (on average 1.6605166051660516) internal successors, (450), 326 states have internal predecessors, (450), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 480 transitions. [2024-10-11 17:57:06,580 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 480 transitions. Word has length 22 [2024-10-11 17:57:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,580 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 480 transitions. [2024-10-11 17:57:06,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 480 transitions. [2024-10-11 17:57:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:06,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:57:06,581 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash -492244314, now seen corresponding path program 1 times [2024-10-11 17:57:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283345363] [2024-10-11 17:57:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283345363] [2024-10-11 17:57:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283345363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848215291] [2024-10-11 17:57:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:06,612 INFO L87 Difference]: Start difference. First operand 345 states and 480 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,653 INFO L93 Difference]: Finished difference Result 354 states and 489 transitions. [2024-10-11 17:57:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:57:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,654 INFO L225 Difference]: With dead ends: 354 [2024-10-11 17:57:06,654 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 17:57:06,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:06,655 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:57:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 17:57:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 17:57:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 280 states have (on average 1.6392857142857142) internal successors, (459), 335 states have internal predecessors, (459), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2024-10-11 17:57:06,661 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 22 [2024-10-11 17:57:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,661 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2024-10-11 17:57:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2024-10-11 17:57:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:06,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:57:06,662 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -492184732, now seen corresponding path program 1 times [2024-10-11 17:57:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471583296] [2024-10-11 17:57:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471583296] [2024-10-11 17:57:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471583296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591537138] [2024-10-11 17:57:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:06,715 INFO L87 Difference]: Start difference. First operand 354 states and 489 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,791 INFO L93 Difference]: Finished difference Result 406 states and 563 transitions. [2024-10-11 17:57:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:57:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,792 INFO L225 Difference]: With dead ends: 406 [2024-10-11 17:57:06,793 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 17:57:06,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:06,794 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 210 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 17:57:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 400. [2024-10-11 17:57:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 327 states have (on average 1.6299694189602447) internal successors, (533), 381 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 563 transitions. [2024-10-11 17:57:06,801 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 563 transitions. Word has length 22 [2024-10-11 17:57:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,801 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 563 transitions. [2024-10-11 17:57:06,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 563 transitions. [2024-10-11 17:57:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:06,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:57:06,803 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -492184733, now seen corresponding path program 1 times [2024-10-11 17:57:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562580202] [2024-10-11 17:57:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562580202] [2024-10-11 17:57:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562580202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713052887] [2024-10-11 17:57:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:06,836 INFO L87 Difference]: Start difference. First operand 400 states and 563 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:06,891 INFO L93 Difference]: Finished difference Result 397 states and 551 transitions. [2024-10-11 17:57:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:57:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:06,892 INFO L225 Difference]: With dead ends: 397 [2024-10-11 17:57:06,892 INFO L226 Difference]: Without dead ends: 397 [2024-10-11 17:57:06,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:06,893 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:06,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 193 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-11 17:57:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-11 17:57:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 327 states have (on average 1.5932721712538227) internal successors, (521), 378 states have internal predecessors, (521), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 551 transitions. [2024-10-11 17:57:06,898 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 551 transitions. Word has length 22 [2024-10-11 17:57:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:06,898 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 551 transitions. [2024-10-11 17:57:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 551 transitions. [2024-10-11 17:57:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:06,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:06,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:06,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:57:06,899 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858885, now seen corresponding path program 1 times [2024-10-11 17:57:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649922986] [2024-10-11 17:57:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:57:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649922986] [2024-10-11 17:57:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649922986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:07,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756330120] [2024-10-11 17:57:07,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:07,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:07,031 INFO L87 Difference]: Start difference. First operand 397 states and 551 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,228 INFO L93 Difference]: Finished difference Result 311 states and 415 transitions. [2024-10-11 17:57:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:07,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 17:57:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,229 INFO L225 Difference]: With dead ends: 311 [2024-10-11 17:57:07,229 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 17:57:07,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:07,229 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 32 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:07,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 693 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 17:57:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2024-10-11 17:57:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 238 states have (on average 1.6218487394957983) internal successors, (386), 287 states have internal predecessors, (386), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 404 transitions. [2024-10-11 17:57:07,241 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 404 transitions. Word has length 23 [2024-10-11 17:57:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 404 transitions. [2024-10-11 17:57:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 404 transitions. [2024-10-11 17:57:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:07,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:07,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:57:07,242 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:07,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1676804042, now seen corresponding path program 1 times [2024-10-11 17:57:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516363081] [2024-10-11 17:57:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516363081] [2024-10-11 17:57:07,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516363081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136547906] [2024-10-11 17:57:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:07,318 INFO L87 Difference]: Start difference. First operand 300 states and 404 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,425 INFO L93 Difference]: Finished difference Result 305 states and 401 transitions. [2024-10-11 17:57:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 17:57:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,426 INFO L225 Difference]: With dead ends: 305 [2024-10-11 17:57:07,426 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 17:57:07,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:07,427 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:07,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 220 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 17:57:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2024-10-11 17:57:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 242 states have internal predecessors, (314), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 332 transitions. [2024-10-11 17:57:07,438 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 332 transitions. Word has length 23 [2024-10-11 17:57:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,438 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 332 transitions. [2024-10-11 17:57:07,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 332 transitions. [2024-10-11 17:57:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:57:07,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:07,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:57:07,439 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:07,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash -543123644, now seen corresponding path program 1 times [2024-10-11 17:57:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295521637] [2024-10-11 17:57:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295521637] [2024-10-11 17:57:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295521637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735717206] [2024-10-11 17:57:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:07,521 INFO L87 Difference]: Start difference. First operand 255 states and 332 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,644 INFO L93 Difference]: Finished difference Result 281 states and 364 transitions. [2024-10-11 17:57:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 17:57:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,646 INFO L225 Difference]: With dead ends: 281 [2024-10-11 17:57:07,646 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 17:57:07,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:07,647 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:07,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 451 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 17:57:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2024-10-11 17:57:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 263 states have internal predecessors, (340), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 358 transitions. [2024-10-11 17:57:07,653 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 358 transitions. Word has length 24 [2024-10-11 17:57:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,654 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 358 transitions. [2024-10-11 17:57:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 358 transitions. [2024-10-11 17:57:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:57:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:57:07,655 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:07,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash -543123450, now seen corresponding path program 1 times [2024-10-11 17:57:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559837443] [2024-10-11 17:57:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559837443] [2024-10-11 17:57:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559837443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445044093] [2024-10-11 17:57:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:07,721 INFO L87 Difference]: Start difference. First operand 276 states and 358 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,792 INFO L93 Difference]: Finished difference Result 357 states and 468 transitions. [2024-10-11 17:57:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 17:57:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,793 INFO L225 Difference]: With dead ends: 357 [2024-10-11 17:57:07,793 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 17:57:07,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:07,794 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:07,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 336 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 17:57:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 344. [2024-10-11 17:57:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 283 states have (on average 1.568904593639576) internal successors, (444), 331 states have internal predecessors, (444), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 462 transitions. [2024-10-11 17:57:07,798 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 462 transitions. Word has length 24 [2024-10-11 17:57:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,799 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 462 transitions. [2024-10-11 17:57:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 462 transitions. [2024-10-11 17:57:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:57:07,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:57:07,800 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 795949804, now seen corresponding path program 1 times [2024-10-11 17:57:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135090081] [2024-10-11 17:57:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135090081] [2024-10-11 17:57:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135090081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:57:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364234100] [2024-10-11 17:57:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:07,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:07,849 INFO L87 Difference]: Start difference. First operand 344 states and 462 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:07,918 INFO L93 Difference]: Finished difference Result 357 states and 462 transitions. [2024-10-11 17:57:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 17:57:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:07,920 INFO L225 Difference]: With dead ends: 357 [2024-10-11 17:57:07,920 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 17:57:07,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:07,920 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 45 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:07,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 17:57:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 275. [2024-10-11 17:57:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 215 states have (on average 1.5534883720930233) internal successors, (334), 262 states have internal predecessors, (334), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 352 transitions. [2024-10-11 17:57:07,926 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 352 transitions. Word has length 25 [2024-10-11 17:57:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 352 transitions. [2024-10-11 17:57:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 352 transitions. [2024-10-11 17:57:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:57:07,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:07,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:57:07,928 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2036155710, now seen corresponding path program 1 times [2024-10-11 17:57:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651137260] [2024-10-11 17:57:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:07,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651137260] [2024-10-11 17:57:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651137260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:07,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868684907] [2024-10-11 17:57:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:07,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:07,969 INFO L87 Difference]: Start difference. First operand 275 states and 352 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,055 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2024-10-11 17:57:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 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 28 [2024-10-11 17:57:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,057 INFO L225 Difference]: With dead ends: 276 [2024-10-11 17:57:08,057 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 17:57:08,057 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-11 17:57:08,057 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 47 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 347 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-11 17:57:08,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 347 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 17:57:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2024-10-11 17:57:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 215 states have (on average 1.544186046511628) internal successors, (332), 261 states have internal predecessors, (332), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 350 transitions. [2024-10-11 17:57:08,061 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 350 transitions. Word has length 28 [2024-10-11 17:57:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 350 transitions. [2024-10-11 17:57:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 350 transitions. [2024-10-11 17:57:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:57:08,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,062 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] [2024-10-11 17:57:08,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:57:08,062 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:08,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2036155711, now seen corresponding path program 1 times [2024-10-11 17:57:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740756732] [2024-10-11 17:57:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740756732] [2024-10-11 17:57:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740756732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591131604] [2024-10-11 17:57:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:08,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:08,141 INFO L87 Difference]: Start difference. First operand 274 states and 350 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,246 INFO L93 Difference]: Finished difference Result 334 states and 430 transitions. [2024-10-11 17:57:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:08,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 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 28 [2024-10-11 17:57:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,247 INFO L225 Difference]: With dead ends: 334 [2024-10-11 17:57:08,247 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 17:57:08,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:08,247 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:08,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 475 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 17:57:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 273. [2024-10-11 17:57:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.5348837209302326) internal successors, (330), 260 states have internal predecessors, (330), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 348 transitions. [2024-10-11 17:57:08,251 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 348 transitions. Word has length 28 [2024-10-11 17:57:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 348 transitions. [2024-10-11 17:57:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 348 transitions. [2024-10-11 17:57:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:57:08,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:57:08,252 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1759446305, now seen corresponding path program 1 times [2024-10-11 17:57:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30696199] [2024-10-11 17:57:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30696199] [2024-10-11 17:57:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30696199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655622039] [2024-10-11 17:57:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:08,298 INFO L87 Difference]: Start difference. First operand 273 states and 348 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,375 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2024-10-11 17:57:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 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 30 [2024-10-11 17:57:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,376 INFO L225 Difference]: With dead ends: 307 [2024-10-11 17:57:08,377 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 17:57:08,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:08,377 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 87 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:08,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 270 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 17:57:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 270. [2024-10-11 17:57:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 215 states have (on average 1.5069767441860464) internal successors, (324), 257 states have internal predecessors, (324), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 342 transitions. [2024-10-11 17:57:08,381 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 342 transitions. Word has length 30 [2024-10-11 17:57:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,381 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 342 transitions. [2024-10-11 17:57:08,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 342 transitions. [2024-10-11 17:57:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:57:08,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:57:08,382 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1759446304, now seen corresponding path program 1 times [2024-10-11 17:57:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909741789] [2024-10-11 17:57:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909741789] [2024-10-11 17:57:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909741789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554058701] [2024-10-11 17:57:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:08,479 INFO L87 Difference]: Start difference. First operand 270 states and 342 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,580 INFO L93 Difference]: Finished difference Result 306 states and 387 transitions. [2024-10-11 17:57:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:08,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 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 30 [2024-10-11 17:57:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,581 INFO L225 Difference]: With dead ends: 306 [2024-10-11 17:57:08,581 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 17:57:08,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:08,582 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 237 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:08,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 259 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 17:57:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 269. [2024-10-11 17:57:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 215 states have (on average 1.4976744186046511) internal successors, (322), 256 states have internal predecessors, (322), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 340 transitions. [2024-10-11 17:57:08,585 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 340 transitions. Word has length 30 [2024-10-11 17:57:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 340 transitions. [2024-10-11 17:57:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 340 transitions. [2024-10-11 17:57:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:57:08,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:08,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:57:08,586 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1759446143, now seen corresponding path program 1 times [2024-10-11 17:57:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314053093] [2024-10-11 17:57:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314053093] [2024-10-11 17:57:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314053093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:08,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423509577] [2024-10-11 17:57:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:08,695 INFO L87 Difference]: Start difference. First operand 269 states and 340 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:08,880 INFO L93 Difference]: Finished difference Result 329 states and 384 transitions. [2024-10-11 17:57:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 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 30 [2024-10-11 17:57:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:08,881 INFO L225 Difference]: With dead ends: 329 [2024-10-11 17:57:08,881 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 17:57:08,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:08,882 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 148 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:08,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 290 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 17:57:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 269. [2024-10-11 17:57:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 256 states have internal predecessors, (320), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 338 transitions. [2024-10-11 17:57:08,885 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 338 transitions. Word has length 30 [2024-10-11 17:57:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:08,886 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 338 transitions. [2024-10-11 17:57:08,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 338 transitions. [2024-10-11 17:57:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:57:08,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:08,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:08,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:57:08,887 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:08,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1267354781, now seen corresponding path program 1 times [2024-10-11 17:57:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546370157] [2024-10-11 17:57:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:09,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546370157] [2024-10-11 17:57:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546370157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401478949] [2024-10-11 17:57:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:09,007 INFO L87 Difference]: Start difference. First operand 269 states and 338 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,098 INFO L93 Difference]: Finished difference Result 272 states and 341 transitions. [2024-10-11 17:57:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 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 41 [2024-10-11 17:57:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,098 INFO L225 Difference]: With dead ends: 272 [2024-10-11 17:57:09,099 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 17:57:09,099 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-11 17:57:09,099 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 260 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:09,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 227 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 17:57:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2024-10-11 17:57:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 217 states have (on average 1.4792626728110598) internal successors, (321), 256 states have internal predecessors, (321), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 339 transitions. [2024-10-11 17:57:09,105 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 339 transitions. Word has length 41 [2024-10-11 17:57:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,105 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 339 transitions. [2024-10-11 17:57:09,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 339 transitions. [2024-10-11 17:57:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:57:09,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:57:09,106 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1267354843, now seen corresponding path program 1 times [2024-10-11 17:57:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381004162] [2024-10-11 17:57:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381004162] [2024-10-11 17:57:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381004162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457208273] [2024-10-11 17:57:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:09,225 INFO L87 Difference]: Start difference. First operand 269 states and 339 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,315 INFO L93 Difference]: Finished difference Result 271 states and 339 transitions. [2024-10-11 17:57:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 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 41 [2024-10-11 17:57:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,316 INFO L225 Difference]: With dead ends: 271 [2024-10-11 17:57:09,316 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 17:57:09,317 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-11 17:57:09,317 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 254 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:09,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 227 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 17:57:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2024-10-11 17:57:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 215 states have (on average 1.4697674418604652) internal successors, (316), 253 states have internal predecessors, (316), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 334 transitions. [2024-10-11 17:57:09,322 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 334 transitions. Word has length 41 [2024-10-11 17:57:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,322 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 334 transitions. [2024-10-11 17:57:09,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 334 transitions. [2024-10-11 17:57:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:57:09,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,323 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-11 17:57:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:57:09,323 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -409373237, now seen corresponding path program 1 times [2024-10-11 17:57:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500915284] [2024-10-11 17:57:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 17:57:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:57:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500915284] [2024-10-11 17:57:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500915284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843783923] [2024-10-11 17:57:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:09,467 INFO L87 Difference]: Start difference. First operand 266 states and 334 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:57:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:09,559 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2024-10-11 17:57:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-11 17:57:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:09,560 INFO L225 Difference]: With dead ends: 265 [2024-10-11 17:57:09,560 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 17:57:09,560 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-11 17:57:09,561 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 259 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:09,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 216 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 17:57:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-10-11 17:57:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 215 states have (on average 1.4465116279069767) internal successors, (311), 250 states have internal predecessors, (311), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 329 transitions. [2024-10-11 17:57:09,565 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 329 transitions. Word has length 43 [2024-10-11 17:57:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:09,565 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 329 transitions. [2024-10-11 17:57:09,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:57:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 329 transitions. [2024-10-11 17:57:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:57:09,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:09,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:09,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 17:57:09,566 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:09,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1842709678, now seen corresponding path program 1 times [2024-10-11 17:57:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104319680] [2024-10-11 17:57:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104319680] [2024-10-11 17:57:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104319680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719632258] [2024-10-11 17:57:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:10,189 INFO L87 Difference]: Start difference. First operand 263 states and 329 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:10,524 INFO L93 Difference]: Finished difference Result 287 states and 354 transitions. [2024-10-11 17:57:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-11 17:57:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:10,525 INFO L225 Difference]: With dead ends: 287 [2024-10-11 17:57:10,525 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 17:57:10,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:10,526 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 63 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:10,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 710 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 17:57:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 281. [2024-10-11 17:57:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 233 states have (on average 1.4163090128755365) internal successors, (330), 268 states have internal predecessors, (330), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 17:57:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 348 transitions. [2024-10-11 17:57:10,530 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 348 transitions. Word has length 43 [2024-10-11 17:57:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 348 transitions. [2024-10-11 17:57:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 348 transitions. [2024-10-11 17:57:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:10,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:10,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:10,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 17:57:10,531 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-11 17:57:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1611312633, now seen corresponding path program 1 times [2024-10-11 17:57:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628752095] [2024-10-11 17:57:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628752095] [2024-10-11 17:57:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628752095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124443086] [2024-10-11 17:57:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:10,869 INFO L87 Difference]: Start difference. First operand 281 states and 348 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:11,189 INFO L93 Difference]: Finished difference Result 561 states and 710 transitions. [2024-10-11 17:57:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:57:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:11,191 INFO L225 Difference]: With dead ends: 561 [2024-10-11 17:57:11,191 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 17:57:11,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:11,192 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 425 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:11,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 728 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 17:57:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 398. [2024-10-11 17:57:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 343 states have (on average 1.4256559766763848) internal successors, (489), 381 states have internal predecessors, (489), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-11 17:57:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 519 transitions. [2024-10-11 17:57:11,197 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 519 transitions. Word has length 44 [2024-10-11 17:57:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 519 transitions. [2024-10-11 17:57:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 519 transitions. [2024-10-11 17:57:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:11,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:11,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:11,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 17:57:11,198 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-11 17:57:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1611312634, now seen corresponding path program 1 times [2024-10-11 17:57:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431173067] [2024-10-11 17:57:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431173067] [2024-10-11 17:57:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431173067] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597776795] [2024-10-11 17:57:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:12,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:12,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:57:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 17:57:12,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:12,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:57:12,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:57:13,013 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 35 treesize of output 1 [2024-10-11 17:57:13,261 INFO L349 Elim1Store]: treesize reduction 89, result has 24.6 percent of original size [2024-10-11 17:57:13,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2024-10-11 17:57:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:13,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2024-10-11 17:57:13,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2024-10-11 17:57:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:13,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597776795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-10-11 17:57:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468433810] [2024-10-11 17:57:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:13,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:13,531 INFO L87 Difference]: Start difference. First operand 398 states and 519 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,227 INFO L93 Difference]: Finished difference Result 597 states and 761 transitions. [2024-10-11 17:57:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:57:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,228 INFO L225 Difference]: With dead ends: 597 [2024-10-11 17:57:14,228 INFO L226 Difference]: Without dead ends: 597 [2024-10-11 17:57:14,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:57:14,229 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 341 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:14,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 831 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:57:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-11 17:57:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 441. [2024-10-11 17:57:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 382 states have (on average 1.442408376963351) internal successors, (551), 422 states have internal predecessors, (551), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-11 17:57:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 587 transitions. [2024-10-11 17:57:14,235 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 587 transitions. Word has length 44 [2024-10-11 17:57:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,235 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 587 transitions. [2024-10-11 17:57:14,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 587 transitions. [2024-10-11 17:57:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:14,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:14,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:57:14,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:14,440 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1611372215, now seen corresponding path program 1 times [2024-10-11 17:57:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701783937] [2024-10-11 17:57:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:14,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:14,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701783937] [2024-10-11 17:57:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701783937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41224359] [2024-10-11 17:57:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:14,602 INFO L87 Difference]: Start difference. First operand 441 states and 587 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,824 INFO L93 Difference]: Finished difference Result 703 states and 933 transitions. [2024-10-11 17:57:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:57:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,826 INFO L225 Difference]: With dead ends: 703 [2024-10-11 17:57:14,826 INFO L226 Difference]: Without dead ends: 703 [2024-10-11 17:57:14,826 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-11 17:57:14,826 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 179 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:14,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 498 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-10-11 17:57:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 541. [2024-10-11 17:57:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 466 states have (on average 1.4334763948497855) internal successors, (668), 514 states have internal predecessors, (668), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-10-11 17:57:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 728 transitions. [2024-10-11 17:57:14,833 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 728 transitions. Word has length 44 [2024-10-11 17:57:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,833 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 728 transitions. [2024-10-11 17:57:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 728 transitions. [2024-10-11 17:57:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:14,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:14,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 17:57:14,834 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1611372216, now seen corresponding path program 1 times [2024-10-11 17:57:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796126450] [2024-10-11 17:57:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796126450] [2024-10-11 17:57:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796126450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933835261] [2024-10-11 17:57:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:15,107 INFO L87 Difference]: Start difference. First operand 541 states and 728 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:15,411 INFO L93 Difference]: Finished difference Result 771 states and 1035 transitions. [2024-10-11 17:57:15,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:15,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:57:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:15,414 INFO L225 Difference]: With dead ends: 771 [2024-10-11 17:57:15,414 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 17:57:15,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:15,414 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 296 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:15,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 681 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 17:57:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 615. [2024-10-11 17:57:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 532 states have (on average 1.4530075187969924) internal successors, (773), 584 states have internal predecessors, (773), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2024-10-11 17:57:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 845 transitions. [2024-10-11 17:57:15,423 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 845 transitions. Word has length 44 [2024-10-11 17:57:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 845 transitions. [2024-10-11 17:57:15,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 845 transitions. [2024-10-11 17:57:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:15,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:15,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 17:57:15,424 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:15,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1788267860, now seen corresponding path program 1 times [2024-10-11 17:57:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846747314] [2024-10-11 17:57:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846747314] [2024-10-11 17:57:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846747314] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280994071] [2024-10-11 17:57:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:15,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:15,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:57:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:16,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 17:57:16,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:16,231 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:57:16,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:57:16,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:57:16,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:57:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:16,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:57:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:16,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280994071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:18,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:57:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2024-10-11 17:57:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118182971] [2024-10-11 17:57:18,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:57:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:57:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=530, Unknown=7, NotChecked=0, Total=650 [2024-10-11 17:57:18,704 INFO L87 Difference]: Start difference. First operand 615 states and 845 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 18 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:57:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:19,448 INFO L93 Difference]: Finished difference Result 890 states and 1173 transitions. [2024-10-11 17:57:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 18 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-11 17:57:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:19,453 INFO L225 Difference]: With dead ends: 890 [2024-10-11 17:57:19,453 INFO L226 Difference]: Without dead ends: 890 [2024-10-11 17:57:19,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=218, Invalid=965, Unknown=7, NotChecked=0, Total=1190 [2024-10-11 17:57:19,454 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 310 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:19,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1954 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:57:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-11 17:57:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 716. [2024-10-11 17:57:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 625 states have (on average 1.4496) internal successors, (906), 680 states have internal predecessors, (906), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 21 states have call predecessors, (56), 28 states have call successors, (56) [2024-10-11 17:57:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 990 transitions. [2024-10-11 17:57:19,467 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 990 transitions. Word has length 44 [2024-10-11 17:57:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:19,467 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 990 transitions. [2024-10-11 17:57:19,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 18 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:57:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 990 transitions. [2024-10-11 17:57:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:57:19,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:19,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:19,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:57:19,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:19,673 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1788208278, now seen corresponding path program 1 times [2024-10-11 17:57:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254508785] [2024-10-11 17:57:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254508785] [2024-10-11 17:57:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254508785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335280476] [2024-10-11 17:57:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:20,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:20,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:57:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:20,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-11 17:57:20,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:20,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:57:20,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:57:20,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:20,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:20,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:20,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:57:20,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:20,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:57:20,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:57:20,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:57:20,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 17:57:20,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 17:57:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:20,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335280476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 28 [2024-10-11 17:57:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308501118] [2024-10-11 17:57:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:20,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:57:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:57:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2024-10-11 17:57:20,966 INFO L87 Difference]: Start difference. First operand 716 states and 990 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:21,617 INFO L93 Difference]: Finished difference Result 727 states and 965 transitions. [2024-10-11 17:57:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:57:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:21,619 INFO L225 Difference]: With dead ends: 727 [2024-10-11 17:57:21,620 INFO L226 Difference]: Without dead ends: 727 [2024-10-11 17:57:21,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 17:57:21,620 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 135 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:21,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 843 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-11 17:57:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 618. [2024-10-11 17:57:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 535 states have (on average 1.4504672897196262) internal successors, (776), 587 states have internal predecessors, (776), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2024-10-11 17:57:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 848 transitions. [2024-10-11 17:57:21,627 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 848 transitions. Word has length 44 [2024-10-11 17:57:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 848 transitions. [2024-10-11 17:57:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 848 transitions. [2024-10-11 17:57:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:21,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:21,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:21,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:57:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:21,829 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 933386794, now seen corresponding path program 1 times [2024-10-11 17:57:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937573358] [2024-10-11 17:57:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937573358] [2024-10-11 17:57:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937573358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:57:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519898750] [2024-10-11 17:57:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:22,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:57:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:57:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:57:22,291 INFO L87 Difference]: Start difference. First operand 618 states and 848 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:22,724 INFO L93 Difference]: Finished difference Result 924 states and 1250 transitions. [2024-10-11 17:57:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:22,726 INFO L225 Difference]: With dead ends: 924 [2024-10-11 17:57:22,726 INFO L226 Difference]: Without dead ends: 924 [2024-10-11 17:57:22,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:22,727 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 368 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:22,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1024 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-10-11 17:57:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 726. [2024-10-11 17:57:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 627 states have (on average 1.4401913875598087) internal successors, (903), 687 states have internal predecessors, (903), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-10-11 17:57:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 999 transitions. [2024-10-11 17:57:22,735 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 999 transitions. Word has length 45 [2024-10-11 17:57:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 999 transitions. [2024-10-11 17:57:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 999 transitions. [2024-10-11 17:57:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:22,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:22,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 17:57:22,736 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 933386795, now seen corresponding path program 1 times [2024-10-11 17:57:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312215667] [2024-10-11 17:57:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312215667] [2024-10-11 17:57:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312215667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:23,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 17:57:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696393691] [2024-10-11 17:57:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:57:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:57:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:57:23,308 INFO L87 Difference]: Start difference. First operand 726 states and 999 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:23,846 INFO L93 Difference]: Finished difference Result 976 states and 1325 transitions. [2024-10-11 17:57:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:23,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:23,850 INFO L225 Difference]: With dead ends: 976 [2024-10-11 17:57:23,850 INFO L226 Difference]: Without dead ends: 976 [2024-10-11 17:57:23,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:23,851 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 290 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:23,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1150 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-11 17:57:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 618. [2024-10-11 17:57:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 535 states have (on average 1.4504672897196262) internal successors, (776), 587 states have internal predecessors, (776), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2024-10-11 17:57:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 848 transitions. [2024-10-11 17:57:23,877 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 848 transitions. Word has length 45 [2024-10-11 17:57:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:23,877 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 848 transitions. [2024-10-11 17:57:23,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 848 transitions. [2024-10-11 17:57:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:23,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:23,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:23,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 17:57:23,878 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:23,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1588917187, now seen corresponding path program 1 times [2024-10-11 17:57:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:23,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427823058] [2024-10-11 17:57:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427823058] [2024-10-11 17:57:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427823058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:57:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616481462] [2024-10-11 17:57:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:24,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:24,239 INFO L87 Difference]: Start difference. First operand 618 states and 848 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:24,536 INFO L93 Difference]: Finished difference Result 970 states and 1313 transitions. [2024-10-11 17:57:24,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:24,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:24,539 INFO L225 Difference]: With dead ends: 970 [2024-10-11 17:57:24,539 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 17:57:24,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:57:24,539 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 396 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:24,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1098 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 17:57:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 805. [2024-10-11 17:57:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 698 states have (on average 1.4541547277936964) internal successors, (1015), 762 states have internal predecessors, (1015), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-11 17:57:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1123 transitions. [2024-10-11 17:57:24,548 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1123 transitions. Word has length 45 [2024-10-11 17:57:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:24,548 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1123 transitions. [2024-10-11 17:57:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1123 transitions. [2024-10-11 17:57:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:24,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:24,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 17:57:24,549 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:24,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1587070145, now seen corresponding path program 1 times [2024-10-11 17:57:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:24,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863132956] [2024-10-11 17:57:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863132956] [2024-10-11 17:57:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863132956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:57:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343210682] [2024-10-11 17:57:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:24,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:24,721 INFO L87 Difference]: Start difference. First operand 805 states and 1123 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:24,910 INFO L93 Difference]: Finished difference Result 968 states and 1321 transitions. [2024-10-11 17:57:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:24,912 INFO L225 Difference]: With dead ends: 968 [2024-10-11 17:57:24,912 INFO L226 Difference]: Without dead ends: 968 [2024-10-11 17:57:24,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:24,913 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 265 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:24,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 800 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-11 17:57:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 805. [2024-10-11 17:57:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 698 states have (on average 1.4541547277936964) internal successors, (1015), 762 states have internal predecessors, (1015), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-11 17:57:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1123 transitions. [2024-10-11 17:57:24,921 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1123 transitions. Word has length 45 [2024-10-11 17:57:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1123 transitions. [2024-10-11 17:57:24,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1123 transitions. [2024-10-11 17:57:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:24,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:24,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 17:57:24,922 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:24,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1839449881, now seen corresponding path program 1 times [2024-10-11 17:57:24,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:24,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139755465] [2024-10-11 17:57:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139755465] [2024-10-11 17:57:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139755465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:25,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261529560] [2024-10-11 17:57:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:25,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:25,120 INFO L87 Difference]: Start difference. First operand 805 states and 1123 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:25,359 INFO L93 Difference]: Finished difference Result 1094 states and 1511 transitions. [2024-10-11 17:57:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:25,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:25,362 INFO L225 Difference]: With dead ends: 1094 [2024-10-11 17:57:25,363 INFO L226 Difference]: Without dead ends: 1094 [2024-10-11 17:57:25,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:25,363 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 229 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:25,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 644 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-11 17:57:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 911. [2024-10-11 17:57:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 788 states have (on average 1.4467005076142132) internal successors, (1140), 860 states have internal predecessors, (1140), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-10-11 17:57:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1272 transitions. [2024-10-11 17:57:25,379 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1272 transitions. Word has length 45 [2024-10-11 17:57:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:25,380 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1272 transitions. [2024-10-11 17:57:25,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1272 transitions. [2024-10-11 17:57:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:25,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:25,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:25,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 17:57:25,380 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1839449880, now seen corresponding path program 1 times [2024-10-11 17:57:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082429085] [2024-10-11 17:57:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082429085] [2024-10-11 17:57:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082429085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:57:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366491574] [2024-10-11 17:57:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:25,715 INFO L87 Difference]: Start difference. First operand 911 states and 1272 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:26,111 INFO L93 Difference]: Finished difference Result 1144 states and 1581 transitions. [2024-10-11 17:57:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:26,114 INFO L225 Difference]: With dead ends: 1144 [2024-10-11 17:57:26,115 INFO L226 Difference]: Without dead ends: 1144 [2024-10-11 17:57:26,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:26,115 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 230 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:26,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 989 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-11 17:57:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 803. [2024-10-11 17:57:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 696 states have (on average 1.4554597701149425) internal successors, (1013), 760 states have internal predecessors, (1013), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-11 17:57:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1121 transitions. [2024-10-11 17:57:26,126 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1121 transitions. Word has length 45 [2024-10-11 17:57:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:26,126 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1121 transitions. [2024-10-11 17:57:26,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1121 transitions. [2024-10-11 17:57:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:26,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:26,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:26,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-11 17:57:26,128 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:26,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1839390299, now seen corresponding path program 1 times [2024-10-11 17:57:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:26,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791797863] [2024-10-11 17:57:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791797863] [2024-10-11 17:57:26,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791797863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:26,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:57:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891405822] [2024-10-11 17:57:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:57:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:57:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:57:26,482 INFO L87 Difference]: Start difference. First operand 803 states and 1121 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:26,986 INFO L93 Difference]: Finished difference Result 1256 states and 1738 transitions. [2024-10-11 17:57:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:57:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:26,989 INFO L225 Difference]: With dead ends: 1256 [2024-10-11 17:57:26,989 INFO L226 Difference]: Without dead ends: 1256 [2024-10-11 17:57:26,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:26,989 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 268 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:26,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1602 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-10-11 17:57:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 943. [2024-10-11 17:57:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 820 states have (on average 1.4548780487804878) internal successors, (1193), 892 states have internal predecessors, (1193), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-10-11 17:57:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1325 transitions. [2024-10-11 17:57:27,008 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1325 transitions. Word has length 45 [2024-10-11 17:57:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:27,008 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1325 transitions. [2024-10-11 17:57:27,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1325 transitions. [2024-10-11 17:57:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:57:27,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:27,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-11 17:57:27,009 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:27,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1839390298, now seen corresponding path program 1 times [2024-10-11 17:57:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38907146] [2024-10-11 17:57:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38907146] [2024-10-11 17:57:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38907146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648820922] [2024-10-11 17:57:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:27,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:27,439 INFO L87 Difference]: Start difference. First operand 943 states and 1325 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:28,005 INFO L93 Difference]: Finished difference Result 1167 states and 1609 transitions. [2024-10-11 17:57:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:28,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 17:57:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:28,008 INFO L225 Difference]: With dead ends: 1167 [2024-10-11 17:57:28,008 INFO L226 Difference]: Without dead ends: 1167 [2024-10-11 17:57:28,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:57:28,009 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 240 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:28,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1591 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:57:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-10-11 17:57:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 982. [2024-10-11 17:57:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 855 states have (on average 1.4608187134502923) internal successors, (1249), 929 states have internal predecessors, (1249), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-10-11 17:57:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1387 transitions. [2024-10-11 17:57:28,019 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1387 transitions. Word has length 45 [2024-10-11 17:57:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:28,019 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1387 transitions. [2024-10-11 17:57:28,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1387 transitions. [2024-10-11 17:57:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:28,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:28,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:28,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-11 17:57:28,020 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:28,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1129781716, now seen corresponding path program 1 times [2024-10-11 17:57:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103489630] [2024-10-11 17:57:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103489630] [2024-10-11 17:57:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103489630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:57:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772750278] [2024-10-11 17:57:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:28,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:57:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:57:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:28,343 INFO L87 Difference]: Start difference. First operand 982 states and 1387 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:28,637 INFO L93 Difference]: Finished difference Result 1354 states and 1882 transitions. [2024-10-11 17:57:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:28,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:57:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:28,640 INFO L225 Difference]: With dead ends: 1354 [2024-10-11 17:57:28,640 INFO L226 Difference]: Without dead ends: 1354 [2024-10-11 17:57:28,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:57:28,641 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 426 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:28,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1131 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-10-11 17:57:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 982. [2024-10-11 17:57:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 855 states have (on average 1.4608187134502923) internal successors, (1249), 929 states have internal predecessors, (1249), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-10-11 17:57:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1387 transitions. [2024-10-11 17:57:28,664 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1387 transitions. Word has length 46 [2024-10-11 17:57:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:28,667 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1387 transitions. [2024-10-11 17:57:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1387 transitions. [2024-10-11 17:57:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:28,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:28,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:28,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 17:57:28,668 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2011723376, now seen corresponding path program 1 times [2024-10-11 17:57:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696698481] [2024-10-11 17:57:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696698481] [2024-10-11 17:57:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696698481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323781674] [2024-10-11 17:57:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:28,973 INFO L87 Difference]: Start difference. First operand 982 states and 1387 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,284 INFO L93 Difference]: Finished difference Result 1348 states and 1873 transitions. [2024-10-11 17:57:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:57:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,287 INFO L225 Difference]: With dead ends: 1348 [2024-10-11 17:57:29,287 INFO L226 Difference]: Without dead ends: 1348 [2024-10-11 17:57:29,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:29,288 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 393 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:29,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 862 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-10-11 17:57:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1173. [2024-10-11 17:57:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1022 states have (on average 1.4608610567514677) internal successors, (1493), 1108 states have internal predecessors, (1493), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 35 states have call predecessors, (116), 58 states have call successors, (116) [2024-10-11 17:57:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1667 transitions. [2024-10-11 17:57:29,316 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1667 transitions. Word has length 46 [2024-10-11 17:57:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,316 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1667 transitions. [2024-10-11 17:57:29,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1667 transitions. [2024-10-11 17:57:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:29,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-11 17:57:29,317 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1954465074, now seen corresponding path program 1 times [2024-10-11 17:57:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172828566] [2024-10-11 17:57:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172828566] [2024-10-11 17:57:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172828566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512522051] [2024-10-11 17:57:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:29,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:29,680 INFO L87 Difference]: Start difference. First operand 1173 states and 1667 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,010 INFO L93 Difference]: Finished difference Result 1327 states and 1861 transitions. [2024-10-11 17:57:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:30,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:57:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,013 INFO L225 Difference]: With dead ends: 1327 [2024-10-11 17:57:30,013 INFO L226 Difference]: Without dead ends: 1327 [2024-10-11 17:57:30,013 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-11 17:57:30,014 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 210 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 536 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-10-11 17:57:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1174. [2024-10-11 17:57:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1023 states have (on average 1.4594330400782014) internal successors, (1493), 1109 states have internal predecessors, (1493), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 35 states have call predecessors, (116), 58 states have call successors, (116) [2024-10-11 17:57:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1667 transitions. [2024-10-11 17:57:30,027 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1667 transitions. Word has length 46 [2024-10-11 17:57:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,027 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1667 transitions. [2024-10-11 17:57:30,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1667 transitions. [2024-10-11 17:57:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:30,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-11 17:57:30,028 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:30,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1188372721, now seen corresponding path program 1 times [2024-10-11 17:57:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274073187] [2024-10-11 17:57:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274073187] [2024-10-11 17:57:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274073187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850857426] [2024-10-11 17:57:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:30,190 INFO L87 Difference]: Start difference. First operand 1174 states and 1667 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,400 INFO L93 Difference]: Finished difference Result 1352 states and 1888 transitions. [2024-10-11 17:57:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:30,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:57:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,403 INFO L225 Difference]: With dead ends: 1352 [2024-10-11 17:57:30,403 INFO L226 Difference]: Without dead ends: 1352 [2024-10-11 17:57:30,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:30,404 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 232 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 823 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-10-11 17:57:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 992. [2024-10-11 17:57:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 865 states have (on average 1.4578034682080925) internal successors, (1261), 939 states have internal predecessors, (1261), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-10-11 17:57:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1399 transitions. [2024-10-11 17:57:30,418 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1399 transitions. Word has length 46 [2024-10-11 17:57:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,418 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1399 transitions. [2024-10-11 17:57:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1399 transitions. [2024-10-11 17:57:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:57:30,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-11 17:57:30,419 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1186525679, now seen corresponding path program 1 times [2024-10-11 17:57:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098613778] [2024-10-11 17:57:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098613778] [2024-10-11 17:57:30,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098613778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:57:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243935807] [2024-10-11 17:57:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:30,597 INFO L87 Difference]: Start difference. First operand 992 states and 1399 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,826 INFO L93 Difference]: Finished difference Result 1206 states and 1674 transitions. [2024-10-11 17:57:30,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:57:30,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:57:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,828 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 17:57:30,828 INFO L226 Difference]: Without dead ends: 1206 [2024-10-11 17:57:30,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:30,828 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 225 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 851 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-10-11 17:57:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 942. [2024-10-11 17:57:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 823 states have (on average 1.4580801944106927) internal successors, (1200), 893 states have internal predecessors, (1200), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2024-10-11 17:57:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1326 transitions. [2024-10-11 17:57:30,838 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1326 transitions. Word has length 46 [2024-10-11 17:57:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1326 transitions. [2024-10-11 17:57:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:57:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1326 transitions. [2024-10-11 17:57:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:57:30,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-11 17:57:30,839 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -663425663, now seen corresponding path program 1 times [2024-10-11 17:57:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167514759] [2024-10-11 17:57:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167514759] [2024-10-11 17:57:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167514759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917899536] [2024-10-11 17:57:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:31,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:31,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:57:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 17:57:31,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:31,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-11 17:57:31,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:31,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-10-11 17:57:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:31,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917899536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-11 17:57:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707730141] [2024-10-11 17:57:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:57:31,803 INFO L87 Difference]: Start difference. First operand 942 states and 1326 transitions. Second operand has 10 states, 9 states have (on average 5.0) 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-11 17:57:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:32,122 INFO L93 Difference]: Finished difference Result 1199 states and 1664 transitions. [2024-10-11 17:57:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) 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-11 17:57:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:32,124 INFO L225 Difference]: With dead ends: 1199 [2024-10-11 17:57:32,124 INFO L226 Difference]: Without dead ends: 1199 [2024-10-11 17:57:32,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:32,124 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 293 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:32,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 635 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-11 17:57:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 940. [2024-10-11 17:57:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 821 states have (on average 1.459196102314251) internal successors, (1198), 891 states have internal predecessors, (1198), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2024-10-11 17:57:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1324 transitions. [2024-10-11 17:57:32,136 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1324 transitions. Word has length 47 [2024-10-11 17:57:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1324 transitions. [2024-10-11 17:57:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) 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-11 17:57:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1324 transitions. [2024-10-11 17:57:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:57:32,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:32,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:32,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:57:32,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-10-11 17:57:32,337 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -606167361, now seen corresponding path program 1 times [2024-10-11 17:57:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674383676] [2024-10-11 17:57:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674383676] [2024-10-11 17:57:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674383676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690247153] [2024-10-11 17:57:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:32,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:32,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:57:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:57:32,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:33,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 17:57:33,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:33,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 17:57:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:33,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690247153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2024-10-11 17:57:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750217180] [2024-10-11 17:57:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:33,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:57:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:33,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:57:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:57:33,214 INFO L87 Difference]: Start difference. First operand 940 states and 1324 transitions. Second operand has 10 states, 9 states have (on average 5.0) 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-11 17:57:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:33,503 INFO L93 Difference]: Finished difference Result 1200 states and 1665 transitions. [2024-10-11 17:57:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) 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-11 17:57:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:33,507 INFO L225 Difference]: With dead ends: 1200 [2024-10-11 17:57:33,507 INFO L226 Difference]: Without dead ends: 1200 [2024-10-11 17:57:33,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:57:33,507 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:33,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 649 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-11 17:57:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1029. [2024-10-11 17:57:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 898 states have (on average 1.4599109131403119) internal successors, (1311), 974 states have internal predecessors, (1311), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2024-10-11 17:57:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1455 transitions. [2024-10-11 17:57:33,529 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1455 transitions. Word has length 47 [2024-10-11 17:57:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:33,530 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1455 transitions. [2024-10-11 17:57:33,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) 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-11 17:57:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1455 transitions. [2024-10-11 17:57:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:57:33,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:33,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:33,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:57:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-10-11 17:57:33,736 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1815220478, now seen corresponding path program 1 times [2024-10-11 17:57:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027284962] [2024-10-11 17:57:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027284962] [2024-10-11 17:57:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027284962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022102182] [2024-10-11 17:57:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:34,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:34,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:57:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:34,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:57:34,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:34,422 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 15 treesize of output 1 [2024-10-11 17:57:34,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:34,557 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 17 treesize of output 9 [2024-10-11 17:57:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:34,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:57:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022102182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:57:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2024-10-11 17:57:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466990601] [2024-10-11 17:57:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:57:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:57:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:57:34,563 INFO L87 Difference]: Start difference. First operand 1029 states and 1455 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 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-11 17:57:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:34,848 INFO L93 Difference]: Finished difference Result 1220 states and 1692 transitions. [2024-10-11 17:57:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 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-11 17:57:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:34,850 INFO L225 Difference]: With dead ends: 1220 [2024-10-11 17:57:34,850 INFO L226 Difference]: Without dead ends: 1220 [2024-10-11 17:57:34,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:34,851 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 322 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:34,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 569 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-10-11 17:57:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 855. [2024-10-11 17:57:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 748 states have (on average 1.4558823529411764) internal successors, (1089), 812 states have internal predecessors, (1089), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-10-11 17:57:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1197 transitions. [2024-10-11 17:57:34,877 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1197 transitions. Word has length 47 [2024-10-11 17:57:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:34,878 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1197 transitions. [2024-10-11 17:57:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 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-11 17:57:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1197 transitions. [2024-10-11 17:57:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:57:34,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:34,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:34,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:57:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2024-10-11 17:57:35,083 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1872478780, now seen corresponding path program 1 times [2024-10-11 17:57:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971195207] [2024-10-11 17:57:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971195207] [2024-10-11 17:57:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971195207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:35,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:35,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828500729] [2024-10-11 17:57:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:35,414 INFO L87 Difference]: Start difference. First operand 855 states and 1197 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 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-11 17:57:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:35,845 INFO L93 Difference]: Finished difference Result 1175 states and 1619 transitions. [2024-10-11 17:57:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:57:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 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-11 17:57:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:35,847 INFO L225 Difference]: With dead ends: 1175 [2024-10-11 17:57:35,847 INFO L226 Difference]: Without dead ends: 1175 [2024-10-11 17:57:35,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:57:35,848 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 238 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:35,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1414 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-11 17:57:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 898. [2024-10-11 17:57:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 787 states have (on average 1.4650571791613722) internal successors, (1153), 853 states have internal predecessors, (1153), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2024-10-11 17:57:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1267 transitions. [2024-10-11 17:57:35,856 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1267 transitions. Word has length 47 [2024-10-11 17:57:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:35,856 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1267 transitions. [2024-10-11 17:57:35,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 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-11 17:57:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1267 transitions. [2024-10-11 17:57:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:57:35,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:35,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-11 17:57:35,857 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:35,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1301649672, now seen corresponding path program 1 times [2024-10-11 17:57:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:35,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490268664] [2024-10-11 17:57:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 17:57:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:57:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490268664] [2024-10-11 17:57:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490268664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:57:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718566482] [2024-10-11 17:57:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:36,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:36,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:36,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:36,162 INFO L87 Difference]: Start difference. First operand 898 states and 1267 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:57:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:36,378 INFO L93 Difference]: Finished difference Result 1140 states and 1583 transitions. [2024-10-11 17:57:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-11 17:57:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:36,380 INFO L225 Difference]: With dead ends: 1140 [2024-10-11 17:57:36,380 INFO L226 Difference]: Without dead ends: 1140 [2024-10-11 17:57:36,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:57:36,381 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 237 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:36,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 786 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-10-11 17:57:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 973. [2024-10-11 17:57:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 850 states have (on average 1.4611764705882353) internal successors, (1242), 922 states have internal predecessors, (1242), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-10-11 17:57:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1374 transitions. [2024-10-11 17:57:36,389 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1374 transitions. Word has length 49 [2024-10-11 17:57:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:36,389 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1374 transitions. [2024-10-11 17:57:36,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:57:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1374 transitions. [2024-10-11 17:57:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:57:36,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:36,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:36,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-11 17:57:36,390 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:36,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash -426258107, now seen corresponding path program 1 times [2024-10-11 17:57:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288444131] [2024-10-11 17:57:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 17:57:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:57:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:36,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288444131] [2024-10-11 17:57:36,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288444131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:36,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:36,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:57:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359053562] [2024-10-11 17:57:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:36,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:57:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:36,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:57:36,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:57:36,696 INFO L87 Difference]: Start difference. First operand 973 states and 1374 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-11 17:57:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:37,010 INFO L93 Difference]: Finished difference Result 1210 states and 1679 transitions. [2024-10-11 17:57:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:57:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-11 17:57:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:37,012 INFO L225 Difference]: With dead ends: 1210 [2024-10-11 17:57:37,012 INFO L226 Difference]: Without dead ends: 1210 [2024-10-11 17:57:37,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:57:37,013 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 330 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:37,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 995 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-10-11 17:57:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 967. [2024-10-11 17:57:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 844 states have (on average 1.4561611374407584) internal successors, (1229), 916 states have internal predecessors, (1229), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-10-11 17:57:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1361 transitions. [2024-10-11 17:57:37,032 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1361 transitions. Word has length 49 [2024-10-11 17:57:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1361 transitions. [2024-10-11 17:57:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-11 17:57:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1361 transitions. [2024-10-11 17:57:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:57:37,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:37,034 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, 1] [2024-10-11 17:57:37,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-11 17:57:37,034 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1696799981, now seen corresponding path program 1 times [2024-10-11 17:57:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048191514] [2024-10-11 17:57:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:37,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 17:57:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:57:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048191514] [2024-10-11 17:57:37,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048191514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:37,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:37,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:37,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114428349] [2024-10-11 17:57:37,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:37,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:37,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:37,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:37,120 INFO L87 Difference]: Start difference. First operand 967 states and 1361 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:57:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:37,230 INFO L93 Difference]: Finished difference Result 973 states and 1347 transitions. [2024-10-11 17:57:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:37,230 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, (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 50 [2024-10-11 17:57:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:37,232 INFO L225 Difference]: With dead ends: 973 [2024-10-11 17:57:37,232 INFO L226 Difference]: Without dead ends: 973 [2024-10-11 17:57:37,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:37,232 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 127 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:37,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-10-11 17:57:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 965. [2024-10-11 17:57:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 844 states have (on average 1.430094786729858) internal successors, (1207), 914 states have internal predecessors, (1207), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-10-11 17:57:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1339 transitions. [2024-10-11 17:57:37,241 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1339 transitions. Word has length 50 [2024-10-11 17:57:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:37,241 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1339 transitions. [2024-10-11 17:57:37,241 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:57:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1339 transitions. [2024-10-11 17:57:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:57:37,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:37,242 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, 1] [2024-10-11 17:57:37,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-11 17:57:37,242 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:57:37,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 643730812, now seen corresponding path program 1 times [2024-10-11 17:57:37,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:37,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826144887] [2024-10-11 17:57:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:57:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 17:57:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:57:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826144887] [2024-10-11 17:57:37,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826144887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631735782] [2024-10-11 17:57:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:37,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:37,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:57:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 17:57:37,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:37,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:38,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-11 17:57:38,090 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-10-11 17:57:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2024-10-11 17:57:42,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:42,207 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 30 treesize of output 12 [2024-10-11 17:57:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:42,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631735782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:42,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:57:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2024-10-11 17:57:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329802174] [2024-10-11 17:57:42,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:42,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 17:57:42,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 17:57:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=567, Unknown=1, NotChecked=0, Total=650 [2024-10-11 17:57:42,286 INFO L87 Difference]: Start difference. First operand 965 states and 1339 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:57:50,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:03,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:07,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:11,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:15,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:19,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:23,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:58:27,168 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]