./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:21:20,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:21:20,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:21:20,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:21:20,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:21:20,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:21:20,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:21:20,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:21:20,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:21:20,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:21:20,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:21:20,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:21:20,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:21:20,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:21:20,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:21:20,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:21:20,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:21:20,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:21:20,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:21:20,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:21:20,980 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:21:20,986 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:21:20,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:21:20,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:21:20,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:21:20,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:21:20,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:21:20,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:21:20,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:21:20,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:21:20,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:21:20,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:21:20,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:21:20,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:20,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:21:20,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:21:20,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:21:20,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:21:20,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:21:20,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:21:20,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:21:20,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:21:20,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2024-11-12 13:21:21,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:21:21,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:21:21,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:21:21,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:21:21,270 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:21:21,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2024-11-12 13:21:22,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:21:22,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:21:22,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-11-12 13:21:22,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27773271/0f895e4b64dd4f088c479af4e7be47a3/FLAGddec108db [2024-11-12 13:21:22,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27773271/0f895e4b64dd4f088c479af4e7be47a3 [2024-11-12 13:21:22,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:21:22,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:21:22,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:22,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:21:22,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:21:22,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:22" (1/1) ... [2024-11-12 13:21:22,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376ddbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:22, skipping insertion in model container [2024-11-12 13:21:22,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:22" (1/1) ... [2024-11-12 13:21:22,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:21:23,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:23,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:21:23,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:23,175 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:21:23,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23 WrapperNode [2024-11-12 13:21:23,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:23,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:23,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:21:23,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:21:23,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,220 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-11-12 13:21:23,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:23,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:21:23,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:21:23,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:21:23,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,253 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-12 13:21:23,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:21:23,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:21:23,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:21:23,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:21:23,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (1/1) ... [2024-11-12 13:21:23,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:23,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:23,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:21:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:21:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-12 13:21:23,356 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:21:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:21:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:21:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:21:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:21:23,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:21:23,466 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:21:23,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:21:23,820 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-12 13:21:23,821 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:21:23,838 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:21:23,840 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 13:21:23,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:23 BoogieIcfgContainer [2024-11-12 13:21:23,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:21:23,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:21:23,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:21:23,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:21:23,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:21:22" (1/3) ... [2024-11-12 13:21:23,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb1d1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:23, skipping insertion in model container [2024-11-12 13:21:23,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:23" (2/3) ... [2024-11-12 13:21:23,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb1d1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:23, skipping insertion in model container [2024-11-12 13:21:23,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:23" (3/3) ... [2024-11-12 13:21:23,849 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2024-11-12 13:21:23,862 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:21:23,862 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-12 13:21:23,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:21:23,913 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;@4be538d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:21:23,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-12 13:21:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 94 states have (on average 1.9574468085106382) internal successors, (184), 159 states have internal predecessors, (184), 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-11-12 13:21:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:21:23,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:21:23,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1074395626, now seen corresponding path program 1 times [2024-11-12 13:21:23,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911002699] [2024-11-12 13:21:23,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911002699] [2024-11-12 13:21:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911002699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720838040] [2024-11-12 13:21:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:21:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:21:24,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:21:24,098 INFO L87 Difference]: Start difference. First operand has 163 states, 94 states have (on average 1.9574468085106382) internal successors, (184), 159 states have internal predecessors, (184), 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 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-11-12 13:21:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,124 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2024-11-12 13:21:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:21:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-11-12 13:21:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,133 INFO L225 Difference]: With dead ends: 163 [2024-11-12 13:21:24,134 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 13:21:24,135 INFO L434 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-11-12 13:21:24,139 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 13:21:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-12 13:21:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 93 states have (on average 1.89247311827957) internal successors, (176), 157 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:21:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2024-11-12 13:21:24,184 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 6 [2024-11-12 13:21:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,185 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2024-11-12 13:21:24,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-11-12 13:21:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2024-11-12 13:21:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:24,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:24,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:21:24,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335204, now seen corresponding path program 1 times [2024-11-12 13:21:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649466590] [2024-11-12 13:21:24,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649466590] [2024-11-12 13:21:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649466590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 13:21:24,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926384526] [2024-11-12 13:21:24,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:24,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:24,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:24,368 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,558 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2024-11-12 13:21:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 13:21:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,560 INFO L225 Difference]: With dead ends: 313 [2024-11-12 13:21:24,562 INFO L226 Difference]: Without dead ends: 313 [2024-11-12 13:21:24,563 INFO L434 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-11-12 13:21:24,565 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 161 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 231 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-12 13:21:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 223. [2024-11-12 13:21:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 152 states have (on average 1.868421052631579) internal successors, (284), 216 states have internal predecessors, (284), 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-11-12 13:21:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 292 transitions. [2024-11-12 13:21:24,589 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 292 transitions. Word has length 7 [2024-11-12 13:21:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,590 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 292 transitions. [2024-11-12 13:21:24,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 292 transitions. [2024-11-12 13:21:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:24,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:21:24,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335203, now seen corresponding path program 1 times [2024-11-12 13:21:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615184742] [2024-11-12 13:21:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615184742] [2024-11-12 13:21:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615184742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651194645] [2024-11-12 13:21:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:24,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:24,739 INFO L87 Difference]: Start difference. First operand 223 states and 292 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,840 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2024-11-12 13:21:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 13:21:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,842 INFO L225 Difference]: With dead ends: 226 [2024-11-12 13:21:24,843 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 13:21:24,843 INFO L434 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-11-12 13:21:24,844 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 175 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 241 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 13:21:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2024-11-12 13:21:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 154 states have (on average 1.8636363636363635) internal successors, (287), 218 states have internal predecessors, (287), 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-11-12 13:21:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 295 transitions. [2024-11-12 13:21:24,856 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 295 transitions. Word has length 7 [2024-11-12 13:21:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,856 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 295 transitions. [2024-11-12 13:21:24,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 295 transitions. [2024-11-12 13:21:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:24,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:21:24,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:24,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335141, now seen corresponding path program 1 times [2024-11-12 13:21:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134395295] [2024-11-12 13:21:24,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134395295] [2024-11-12 13:21:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134395295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400491898] [2024-11-12 13:21:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:24,923 INFO L87 Difference]: Start difference. First operand 225 states and 295 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,016 INFO L93 Difference]: Finished difference Result 225 states and 293 transitions. [2024-11-12 13:21:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 13:21:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,017 INFO L225 Difference]: With dead ends: 225 [2024-11-12 13:21:25,018 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 13:21:25,018 INFO L434 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-11-12 13:21:25,020 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 173 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 241 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 13:21:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2024-11-12 13:21:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 152 states have (on average 1.855263157894737) internal successors, (282), 215 states have internal predecessors, (282), 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-11-12 13:21:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2024-11-12 13:21:25,036 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 7 [2024-11-12 13:21:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,036 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2024-11-12 13:21:25,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2024-11-12 13:21:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:25,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:21:25,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:25,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1138725070, now seen corresponding path program 1 times [2024-11-12 13:21:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046861464] [2024-11-12 13:21:25,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046861464] [2024-11-12 13:21:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046861464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329799190] [2024-11-12 13:21:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:25,231 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,415 INFO L93 Difference]: Finished difference Result 391 states and 503 transitions. [2024-11-12 13:21:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 13:21:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,417 INFO L225 Difference]: With dead ends: 391 [2024-11-12 13:21:25,417 INFO L226 Difference]: Without dead ends: 391 [2024-11-12 13:21:25,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:25,418 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 131 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 709 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-12 13:21:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 288. [2024-11-12 13:21:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 212 states have (on average 1.7971698113207548) internal successors, (381), 277 states have internal predecessors, (381), 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-11-12 13:21:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2024-11-12 13:21:25,427 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 10 [2024-11-12 13:21:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,428 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2024-11-12 13:21:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2024-11-12 13:21:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:25,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:21:25,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1140572112, now seen corresponding path program 1 times [2024-11-12 13:21:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430302983] [2024-11-12 13:21:25,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430302983] [2024-11-12 13:21:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430302983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342864465] [2024-11-12 13:21:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:25,517 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,665 INFO L93 Difference]: Finished difference Result 381 states and 492 transitions. [2024-11-12 13:21:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 13:21:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,668 INFO L225 Difference]: With dead ends: 381 [2024-11-12 13:21:25,671 INFO L226 Difference]: Without dead ends: 381 [2024-11-12 13:21:25,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:25,673 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 116 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 706 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-11-12 13:21:25,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 706 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-12 13:21:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2024-11-12 13:21:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 212 states have (on average 1.7971698113207548) internal successors, (381), 277 states have internal predecessors, (381), 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-11-12 13:21:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2024-11-12 13:21:25,686 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 10 [2024-11-12 13:21:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,687 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2024-11-12 13:21:25,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2024-11-12 13:21:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:21:25,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:21:25,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 940737540, now seen corresponding path program 1 times [2024-11-12 13:21:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652466191] [2024-11-12 13:21:25,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652466191] [2024-11-12 13:21:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652466191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339384283] [2024-11-12 13:21:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:25,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:25,712 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,799 INFO L93 Difference]: Finished difference Result 339 states and 444 transitions. [2024-11-12 13:21:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-12 13:21:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,802 INFO L225 Difference]: With dead ends: 339 [2024-11-12 13:21:25,802 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 13:21:25,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:25,803 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 265 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 13:21:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 285. [2024-11-12 13:21:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 209 states have (on average 1.799043062200957) internal successors, (376), 274 states have internal predecessors, (376), 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-11-12 13:21:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2024-11-12 13:21:25,814 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 11 [2024-11-12 13:21:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,814 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2024-11-12 13:21:25,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2024-11-12 13:21:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:25,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:21:25,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:25,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash 418669755, now seen corresponding path program 1 times [2024-11-12 13:21:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992155030] [2024-11-12 13:21:25,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992155030] [2024-11-12 13:21:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992155030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126913163] [2024-11-12 13:21:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:25,886 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,072 INFO L93 Difference]: Finished difference Result 381 states and 467 transitions. [2024-11-12 13:21:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 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 15 [2024-11-12 13:21:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,074 INFO L225 Difference]: With dead ends: 381 [2024-11-12 13:21:26,076 INFO L226 Difference]: Without dead ends: 381 [2024-11-12 13:21:26,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:26,076 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 164 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-12 13:21:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 291. [2024-11-12 13:21:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 215 states have (on average 1.7767441860465116) internal successors, (382), 280 states have internal predecessors, (382), 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-11-12 13:21:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 398 transitions. [2024-11-12 13:21:26,087 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 398 transitions. Word has length 15 [2024-11-12 13:21:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 398 transitions. [2024-11-12 13:21:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 398 transitions. [2024-11-12 13:21:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:26,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:21:26,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:26,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 418669756, now seen corresponding path program 1 times [2024-11-12 13:21:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263210262] [2024-11-12 13:21:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263210262] [2024-11-12 13:21:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263210262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108919289] [2024-11-12 13:21:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:26,149 INFO L87 Difference]: Start difference. First operand 291 states and 398 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,243 INFO L93 Difference]: Finished difference Result 292 states and 390 transitions. [2024-11-12 13:21:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:26,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 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 15 [2024-11-12 13:21:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,244 INFO L225 Difference]: With dead ends: 292 [2024-11-12 13:21:26,244 INFO L226 Difference]: Without dead ends: 292 [2024-11-12 13:21:26,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:26,245 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 228 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-12 13:21:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-12 13:21:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 215 states have (on average 1.7209302325581395) internal successors, (370), 277 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-11-12 13:21:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2024-11-12 13:21:26,250 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 15 [2024-11-12 13:21:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,250 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2024-11-12 13:21:26,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2024-11-12 13:21:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:26,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:21:26,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash -66961466, now seen corresponding path program 1 times [2024-11-12 13:21:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139184185] [2024-11-12 13:21:26,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139184185] [2024-11-12 13:21:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139184185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052372981] [2024-11-12 13:21:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:26,336 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,516 INFO L93 Difference]: Finished difference Result 394 states and 488 transitions. [2024-11-12 13:21:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:26,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 13:21:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,517 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:26,518 INFO L226 Difference]: Without dead ends: 394 [2024-11-12 13:21:26,518 INFO L434 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-11-12 13:21:26,518 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 330 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 313 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-12 13:21:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2024-11-12 13:21:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 216 states have (on average 1.6851851851851851) internal successors, (364), 274 states have internal predecessors, (364), 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-11-12 13:21:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-11-12 13:21:26,524 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 17 [2024-11-12 13:21:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,524 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-11-12 13:21:26,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-12 13:21:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:26,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:21:26,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:26,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash -66961465, now seen corresponding path program 1 times [2024-11-12 13:21:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622369561] [2024-11-12 13:21:26,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622369561] [2024-11-12 13:21:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622369561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229189575] [2024-11-12 13:21:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:26,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:26,649 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,845 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2024-11-12 13:21:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 13:21:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,847 INFO L225 Difference]: With dead ends: 357 [2024-11-12 13:21:26,847 INFO L226 Difference]: Without dead ends: 357 [2024-11-12 13:21:26,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:26,847 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 246 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 464 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-12 13:21:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2024-11-12 13:21:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 274 states have (on average 1.667883211678832) internal successors, (457), 334 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 481 transitions. [2024-11-12 13:21:26,854 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 481 transitions. Word has length 17 [2024-11-12 13:21:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,854 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 481 transitions. [2024-11-12 13:21:26,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 481 transitions. [2024-11-12 13:21:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:26,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:21:26,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:26,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1874415928, now seen corresponding path program 1 times [2024-11-12 13:21:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232816736] [2024-11-12 13:21:26,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232816736] [2024-11-12 13:21:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232816736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571498144] [2024-11-12 13:21:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:26,905 INFO L87 Difference]: Start difference. First operand 347 states and 481 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,926 INFO L93 Difference]: Finished difference Result 347 states and 479 transitions. [2024-11-12 13:21:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 13:21:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,928 INFO L225 Difference]: With dead ends: 347 [2024-11-12 13:21:26,928 INFO L226 Difference]: Without dead ends: 347 [2024-11-12 13:21:26,928 INFO L434 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-11-12 13:21:26,929 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 1 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 861 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-12 13:21:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-12 13:21:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 274 states have (on average 1.6605839416058394) internal successors, (455), 334 states have internal predecessors, (455), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2024-11-12 13:21:26,935 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 17 [2024-11-12 13:21:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,935 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2024-11-12 13:21:26,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2024-11-12 13:21:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:21:26,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:21:26,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:26,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2022703953, now seen corresponding path program 1 times [2024-11-12 13:21:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406838601] [2024-11-12 13:21:26,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406838601] [2024-11-12 13:21:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406838601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:27,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259295602] [2024-11-12 13:21:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:27,100 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 13:21:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:27,277 INFO L93 Difference]: Finished difference Result 398 states and 550 transitions. [2024-11-12 13:21:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 13:21:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:27,279 INFO L225 Difference]: With dead ends: 398 [2024-11-12 13:21:27,279 INFO L226 Difference]: Without dead ends: 398 [2024-11-12 13:21:27,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:27,280 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 200 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:27,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 552 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-12 13:21:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 342. [2024-11-12 13:21:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 269 states have (on average 1.661710037174721) internal successors, (447), 329 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 471 transitions. [2024-11-12 13:21:27,287 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 471 transitions. Word has length 18 [2024-11-12 13:21:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 471 transitions. [2024-11-12 13:21:27,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 13:21:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 471 transitions. [2024-11-12 13:21:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:27,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:27,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:27,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:21:27,288 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 413987999, now seen corresponding path program 1 times [2024-11-12 13:21:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:27,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717751345] [2024-11-12 13:21:27,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717751345] [2024-11-12 13:21:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717751345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289316882] [2024-11-12 13:21:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:27,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:27,567 INFO L87 Difference]: Start difference. First operand 342 states and 471 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:27,863 INFO L93 Difference]: Finished difference Result 450 states and 593 transitions. [2024-11-12 13:21:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-12 13:21:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:27,865 INFO L225 Difference]: With dead ends: 450 [2024-11-12 13:21:27,866 INFO L226 Difference]: Without dead ends: 450 [2024-11-12 13:21:27,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:27,866 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 109 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:27,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1006 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-12 13:21:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 336. [2024-11-12 13:21:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.6577946768060836) internal successors, (436), 323 states have internal predecessors, (436), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 460 transitions. [2024-11-12 13:21:27,874 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 460 transitions. Word has length 21 [2024-11-12 13:21:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:27,875 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 460 transitions. [2024-11-12 13:21:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 460 transitions. [2024-11-12 13:21:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:27,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:27,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:21:27,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1380079796, now seen corresponding path program 1 times [2024-11-12 13:21:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979710787] [2024-11-12 13:21:27,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979710787] [2024-11-12 13:21:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979710787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926352821] [2024-11-12 13:21:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:28,043 INFO L87 Difference]: Start difference. First operand 336 states and 460 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,269 INFO L93 Difference]: Finished difference Result 476 states and 628 transitions. [2024-11-12 13:21:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:21:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-12 13:21:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,271 INFO L225 Difference]: With dead ends: 476 [2024-11-12 13:21:28,271 INFO L226 Difference]: Without dead ends: 476 [2024-11-12 13:21:28,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:28,271 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 140 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 971 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-12 13:21:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 354. [2024-11-12 13:21:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 281 states have (on average 1.6334519572953736) internal successors, (459), 339 states have internal predecessors, (459), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 483 transitions. [2024-11-12 13:21:28,279 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 483 transitions. Word has length 21 [2024-11-12 13:21:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,280 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 483 transitions. [2024-11-12 13:21:28,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 483 transitions. [2024-11-12 13:21:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:21:28,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,281 INFO L218 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-11-12 13:21:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:21:28,281 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:28,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash -548760106, now seen corresponding path program 1 times [2024-11-12 13:21:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778296382] [2024-11-12 13:21:28,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778296382] [2024-11-12 13:21:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778296382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207746826] [2024-11-12 13:21:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:28,428 INFO L87 Difference]: Start difference. First operand 354 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-11-12 13:21:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,643 INFO L93 Difference]: Finished difference Result 476 states and 622 transitions. [2024-11-12 13:21:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:21:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-11-12 13:21:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,647 INFO L225 Difference]: With dead ends: 476 [2024-11-12 13:21:28,647 INFO L226 Difference]: Without dead ends: 476 [2024-11-12 13:21:28,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:28,648 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 117 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1125 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-12 13:21:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 362. [2024-11-12 13:21:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 289 states have (on average 1.6159169550173011) internal successors, (467), 345 states have internal predecessors, (467), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 491 transitions. [2024-11-12 13:21:28,655 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 491 transitions. Word has length 22 [2024-11-12 13:21:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 491 transitions. [2024-11-12 13:21:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-11-12 13:21:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 491 transitions. [2024-11-12 13:21:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:28,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,657 INFO L218 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-11-12 13:21:28,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:21:28,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:28,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1581850198, now seen corresponding path program 1 times [2024-11-12 13:21:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149973124] [2024-11-12 13:21:28,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149973124] [2024-11-12 13:21:28,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149973124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:28,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:28,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508151953] [2024-11-12 13:21:28,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:28,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:28,706 INFO L87 Difference]: Start difference. First operand 362 states and 491 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,780 INFO L93 Difference]: Finished difference Result 362 states and 489 transitions. [2024-11-12 13:21:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-12 13:21:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,781 INFO L225 Difference]: With dead ends: 362 [2024-11-12 13:21:28,782 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 13:21:28,782 INFO L434 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-11-12 13:21:28,782 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 38 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 366 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 13:21:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 357. [2024-11-12 13:21:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 290 states have (on average 1.5827586206896551) internal successors, (459), 340 states have internal predecessors, (459), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 13:21:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 483 transitions. [2024-11-12 13:21:28,788 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 483 transitions. Word has length 23 [2024-11-12 13:21:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,788 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 483 transitions. [2024-11-12 13:21:28,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 483 transitions. [2024-11-12 13:21:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:28,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,789 INFO L218 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-11-12 13:21:28,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:21:28,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:28,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1581850197, now seen corresponding path program 1 times [2024-11-12 13:21:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625852681] [2024-11-12 13:21:28,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:28,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625852681] [2024-11-12 13:21:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625852681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516170262] [2024-11-12 13:21:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:28,894 INFO L87 Difference]: Start difference. First operand 357 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-11-12 13:21:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,034 INFO L93 Difference]: Finished difference Result 334 states and 443 transitions. [2024-11-12 13:21:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-11-12 13:21:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,036 INFO L225 Difference]: With dead ends: 334 [2024-11-12 13:21:29,036 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 13:21:29,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:29,037 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1014 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 13:21:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 304. [2024-11-12 13:21:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.6099585062240664) internal successors, (388), 291 states have internal predecessors, (388), 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-11-12 13:21:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2024-11-12 13:21:29,060 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 23 [2024-11-12 13:21:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,060 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2024-11-12 13:21:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-11-12 13:21:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2024-11-12 13:21:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:29,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:21:29,061 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1433519231, now seen corresponding path program 1 times [2024-11-12 13:21:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856629322] [2024-11-12 13:21:29,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856629322] [2024-11-12 13:21:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856629322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667526858] [2024-11-12 13:21:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:29,089 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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-11-12 13:21:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,103 INFO L93 Difference]: Finished difference Result 316 states and 418 transitions. [2024-11-12 13:21:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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-11-12 13:21:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,104 INFO L225 Difference]: With dead ends: 316 [2024-11-12 13:21:29,104 INFO L226 Difference]: Without dead ends: 316 [2024-11-12 13:21:29,105 INFO L434 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-11-12 13:21:29,105 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-12 13:21:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-12 13:21:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 253 states have (on average 1.5810276679841897) internal successors, (400), 303 states have internal predecessors, (400), 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-11-12 13:21:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 418 transitions. [2024-11-12 13:21:29,110 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 418 transitions. Word has length 25 [2024-11-12 13:21:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 418 transitions. [2024-11-12 13:21:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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-11-12 13:21:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 418 transitions. [2024-11-12 13:21:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:29,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:21:29,111 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1431672189, now seen corresponding path program 1 times [2024-11-12 13:21:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340352700] [2024-11-12 13:21:29,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340352700] [2024-11-12 13:21:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340352700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076985409] [2024-11-12 13:21:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:29,158 INFO L87 Difference]: Start difference. First operand 316 states and 418 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-11-12 13:21:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,226 INFO L93 Difference]: Finished difference Result 394 states and 525 transitions. [2024-11-12 13:21:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:29,227 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-11-12 13:21:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,228 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:29,228 INFO L226 Difference]: Without dead ends: 394 [2024-11-12 13:21:29,228 INFO L434 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-11-12 13:21:29,229 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 73 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 247 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-12 13:21:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 388. [2024-11-12 13:21:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 325 states have (on average 1.56) internal successors, (507), 375 states have internal predecessors, (507), 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-11-12 13:21:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 525 transitions. [2024-11-12 13:21:29,234 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 525 transitions. Word has length 25 [2024-11-12 13:21:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 525 transitions. [2024-11-12 13:21:29,234 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-11-12 13:21:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 525 transitions. [2024-11-12 13:21:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:29,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:21:29,235 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1431672190, now seen corresponding path program 1 times [2024-11-12 13:21:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371375607] [2024-11-12 13:21:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371375607] [2024-11-12 13:21:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371375607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247251300] [2024-11-12 13:21:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:29,260 INFO L87 Difference]: Start difference. First operand 388 states and 525 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-11-12 13:21:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,341 INFO L93 Difference]: Finished difference Result 386 states and 513 transitions. [2024-11-12 13:21:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-11-12 13:21:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,343 INFO L225 Difference]: With dead ends: 386 [2024-11-12 13:21:29,343 INFO L226 Difference]: Without dead ends: 386 [2024-11-12 13:21:29,343 INFO L434 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-11-12 13:21:29,343 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 221 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-12 13:21:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-12 13:21:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.523076923076923) internal successors, (495), 373 states have internal predecessors, (495), 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-11-12 13:21:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 513 transitions. [2024-11-12 13:21:29,350 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 513 transitions. Word has length 25 [2024-11-12 13:21:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,350 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 513 transitions. [2024-11-12 13:21:29,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-11-12 13:21:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 513 transitions. [2024-11-12 13:21:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:29,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:21:29,351 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1827200530, now seen corresponding path program 1 times [2024-11-12 13:21:29,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819809749] [2024-11-12 13:21:29,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819809749] [2024-11-12 13:21:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819809749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959715012] [2024-11-12 13:21:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:29,410 INFO L87 Difference]: Start difference. First operand 386 states and 513 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,434 INFO L93 Difference]: Finished difference Result 435 states and 576 transitions. [2024-11-12 13:21:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 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 26 [2024-11-12 13:21:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,436 INFO L225 Difference]: With dead ends: 435 [2024-11-12 13:21:29,436 INFO L226 Difference]: Without dead ends: 435 [2024-11-12 13:21:29,436 INFO L434 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-11-12 13:21:29,437 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 44 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 795 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-12 13:21:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 386. [2024-11-12 13:21:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 373 states have internal predecessors, (492), 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-11-12 13:21:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2024-11-12 13:21:29,443 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 26 [2024-11-12 13:21:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,444 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2024-11-12 13:21:29,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2024-11-12 13:21:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:29,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:21:29,445 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1470694413, now seen corresponding path program 1 times [2024-11-12 13:21:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992765360] [2024-11-12 13:21:29,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992765360] [2024-11-12 13:21:29,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992765360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716957772] [2024-11-12 13:21:29,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:29,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:29,511 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,626 INFO L93 Difference]: Finished difference Result 464 states and 613 transitions. [2024-11-12 13:21:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 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 26 [2024-11-12 13:21:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,628 INFO L225 Difference]: With dead ends: 464 [2024-11-12 13:21:29,628 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 13:21:29,628 INFO L434 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-11-12 13:21:29,629 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 261 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 13:21:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 386. [2024-11-12 13:21:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 373 states have internal predecessors, (492), 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-11-12 13:21:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2024-11-12 13:21:29,643 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 26 [2024-11-12 13:21:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,643 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2024-11-12 13:21:29,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2024-11-12 13:21:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:29,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:21:29,648 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2123208305, now seen corresponding path program 1 times [2024-11-12 13:21:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418666321] [2024-11-12 13:21:29,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418666321] [2024-11-12 13:21:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418666321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:29,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160513598] [2024-11-12 13:21:29,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:29,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:29,696 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,711 INFO L93 Difference]: Finished difference Result 313 states and 400 transitions. [2024-11-12 13:21:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:29,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 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 26 [2024-11-12 13:21:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,713 INFO L225 Difference]: With dead ends: 313 [2024-11-12 13:21:29,713 INFO L226 Difference]: Without dead ends: 313 [2024-11-12 13:21:29,713 INFO L434 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-11-12 13:21:29,713 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 805 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-12 13:21:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-12 13:21:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 253 states have (on average 1.5098814229249011) internal successors, (382), 300 states have internal predecessors, (382), 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-11-12 13:21:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2024-11-12 13:21:29,718 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 26 [2024-11-12 13:21:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2024-11-12 13:21:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2024-11-12 13:21:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:29,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:21:29,719 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1447437661, now seen corresponding path program 1 times [2024-11-12 13:21:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105497606] [2024-11-12 13:21:29,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105497606] [2024-11-12 13:21:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105497606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:29,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735078787] [2024-11-12 13:21:29,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:29,811 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,906 INFO L93 Difference]: Finished difference Result 351 states and 446 transitions. [2024-11-12 13:21:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-12 13:21:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,908 INFO L225 Difference]: With dead ends: 351 [2024-11-12 13:21:29,908 INFO L226 Difference]: Without dead ends: 351 [2024-11-12 13:21:29,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:29,909 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 681 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-12 13:21:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2024-11-12 13:21:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 285 states have (on average 1.4736842105263157) internal successors, (420), 332 states have internal predecessors, (420), 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-11-12 13:21:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 438 transitions. [2024-11-12 13:21:29,914 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 438 transitions. Word has length 27 [2024-11-12 13:21:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 438 transitions. [2024-11-12 13:21:29,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 438 transitions. [2024-11-12 13:21:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:29,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:21:29,915 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:29,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1447437467, now seen corresponding path program 1 times [2024-11-12 13:21:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741663803] [2024-11-12 13:21:29,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741663803] [2024-11-12 13:21:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741663803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988341785] [2024-11-12 13:21:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:29,969 INFO L87 Difference]: Start difference. First operand 345 states and 438 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,012 INFO L93 Difference]: Finished difference Result 492 states and 635 transitions. [2024-11-12 13:21:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-12 13:21:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,014 INFO L225 Difference]: With dead ends: 492 [2024-11-12 13:21:30,014 INFO L226 Difference]: Without dead ends: 492 [2024-11-12 13:21:30,014 INFO L434 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-11-12 13:21:30,014 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 82 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 426 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-12 13:21:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 457. [2024-11-12 13:21:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 397 states have (on average 1.4534005037783375) internal successors, (577), 444 states have internal predecessors, (577), 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-11-12 13:21:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 595 transitions. [2024-11-12 13:21:30,021 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 595 transitions. Word has length 27 [2024-11-12 13:21:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,021 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 595 transitions. [2024-11-12 13:21:30,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 595 transitions. [2024-11-12 13:21:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:21:30,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,022 INFO L218 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-11-12 13:21:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:21:30,022 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 293091951, now seen corresponding path program 1 times [2024-11-12 13:21:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745141001] [2024-11-12 13:21:30,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745141001] [2024-11-12 13:21:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745141001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265724916] [2024-11-12 13:21:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:30,075 INFO L87 Difference]: Start difference. First operand 457 states and 595 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11-12 13:21:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,163 INFO L93 Difference]: Finished difference Result 492 states and 627 transitions. [2024-11-12 13:21:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:30,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11-12 13:21:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,165 INFO L225 Difference]: With dead ends: 492 [2024-11-12 13:21:30,165 INFO L226 Difference]: Without dead ends: 492 [2024-11-12 13:21:30,165 INFO L434 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-11-12 13:21:30,165 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 352 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-12 13:21:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 344. [2024-11-12 13:21:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 285 states have (on average 1.4456140350877194) internal successors, (412), 331 states have internal predecessors, (412), 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-11-12 13:21:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 430 transitions. [2024-11-12 13:21:30,171 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 430 transitions. Word has length 28 [2024-11-12 13:21:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,171 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 430 transitions. [2024-11-12 13:21:30,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11-12 13:21:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 430 transitions. [2024-11-12 13:21:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:21:30,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:21:30,172 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash -417408815, now seen corresponding path program 1 times [2024-11-12 13:21:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548837138] [2024-11-12 13:21:30,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548837138] [2024-11-12 13:21:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548837138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974419382] [2024-11-12 13:21:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:30,297 INFO L87 Difference]: Start difference. First operand 344 states and 430 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,381 INFO L93 Difference]: Finished difference Result 345 states and 430 transitions. [2024-11-12 13:21:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:30,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 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 33 [2024-11-12 13:21:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,383 INFO L225 Difference]: With dead ends: 345 [2024-11-12 13:21:30,383 INFO L226 Difference]: Without dead ends: 345 [2024-11-12 13:21:30,383 INFO L434 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-11-12 13:21:30,383 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 40 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 421 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-12 13:21:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-11-12 13:21:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 285 states have (on average 1.4385964912280702) internal successors, (410), 330 states have internal predecessors, (410), 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-11-12 13:21:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 428 transitions. [2024-11-12 13:21:30,388 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 428 transitions. Word has length 33 [2024-11-12 13:21:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,388 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 428 transitions. [2024-11-12 13:21:30,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 428 transitions. [2024-11-12 13:21:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:21:30,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 13:21:30,389 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -417408816, now seen corresponding path program 1 times [2024-11-12 13:21:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007598579] [2024-11-12 13:21:30,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007598579] [2024-11-12 13:21:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007598579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825802964] [2024-11-12 13:21:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:30,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:30,432 INFO L87 Difference]: Start difference. First operand 343 states and 428 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,520 INFO L93 Difference]: Finished difference Result 344 states and 428 transitions. [2024-11-12 13:21:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 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 33 [2024-11-12 13:21:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,522 INFO L225 Difference]: With dead ends: 344 [2024-11-12 13:21:30,522 INFO L226 Difference]: Without dead ends: 344 [2024-11-12 13:21:30,522 INFO L434 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-11-12 13:21:30,522 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 52 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 409 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-12 13:21:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2024-11-12 13:21:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 285 states have (on average 1.431578947368421) internal successors, (408), 329 states have internal predecessors, (408), 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-11-12 13:21:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2024-11-12 13:21:30,527 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 33 [2024-11-12 13:21:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,527 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2024-11-12 13:21:30,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2024-11-12 13:21:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:21:30,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 13:21:30,528 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910415, now seen corresponding path program 1 times [2024-11-12 13:21:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590514684] [2024-11-12 13:21:30,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590514684] [2024-11-12 13:21:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590514684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944305246] [2024-11-12 13:21:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:30,597 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,666 INFO L93 Difference]: Finished difference Result 348 states and 422 transitions. [2024-11-12 13:21:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 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 35 [2024-11-12 13:21:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,668 INFO L225 Difference]: With dead ends: 348 [2024-11-12 13:21:30,668 INFO L226 Difference]: Without dead ends: 348 [2024-11-12 13:21:30,668 INFO L434 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-11-12 13:21:30,668 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 98 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 327 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-12 13:21:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2024-11-12 13:21:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 285 states have (on average 1.4105263157894736) internal successors, (402), 326 states have internal predecessors, (402), 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-11-12 13:21:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2024-11-12 13:21:30,673 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 35 [2024-11-12 13:21:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2024-11-12 13:21:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2024-11-12 13:21:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:21:30,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 13:21:30,674 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910414, now seen corresponding path program 1 times [2024-11-12 13:21:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276707181] [2024-11-12 13:21:30,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276707181] [2024-11-12 13:21:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276707181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055464339] [2024-11-12 13:21:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:30,761 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,859 INFO L93 Difference]: Finished difference Result 347 states and 420 transitions. [2024-11-12 13:21:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 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 35 [2024-11-12 13:21:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,861 INFO L225 Difference]: With dead ends: 347 [2024-11-12 13:21:30,861 INFO L226 Difference]: Without dead ends: 347 [2024-11-12 13:21:30,861 INFO L434 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-11-12 13:21:30,861 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 263 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 310 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-12 13:21:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 338. [2024-11-12 13:21:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 285 states have (on average 1.4035087719298245) internal successors, (400), 325 states have internal predecessors, (400), 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-11-12 13:21:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 418 transitions. [2024-11-12 13:21:30,867 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 418 transitions. Word has length 35 [2024-11-12 13:21:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,868 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 418 transitions. [2024-11-12 13:21:30,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 418 transitions. [2024-11-12 13:21:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:21:30,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 13:21:30,869 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:30,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910253, now seen corresponding path program 1 times [2024-11-12 13:21:30,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310677385] [2024-11-12 13:21:30,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310677385] [2024-11-12 13:21:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310677385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:31,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 13:21:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066939644] [2024-11-12 13:21:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:31,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:31,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:31,448 INFO L87 Difference]: Start difference. First operand 338 states and 418 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:31,864 INFO L93 Difference]: Finished difference Result 438 states and 535 transitions. [2024-11-12 13:21:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:31,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 1 states have call successors, (1), 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 35 [2024-11-12 13:21:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:31,866 INFO L225 Difference]: With dead ends: 438 [2024-11-12 13:21:31,866 INFO L226 Difference]: Without dead ends: 438 [2024-11-12 13:21:31,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:21:31,866 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 297 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:31,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 761 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-12 13:21:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 408. [2024-11-12 13:21:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.371830985915493) internal successors, (487), 395 states have internal predecessors, (487), 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-11-12 13:21:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 505 transitions. [2024-11-12 13:21:31,873 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 505 transitions. Word has length 35 [2024-11-12 13:21:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:31,873 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 505 transitions. [2024-11-12 13:21:31,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 505 transitions. [2024-11-12 13:21:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:21:31,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:31,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:31,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 13:21:31,873 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:31,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1095615204, now seen corresponding path program 1 times [2024-11-12 13:21:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034617321] [2024-11-12 13:21:31,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:32,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034617321] [2024-11-12 13:21:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034617321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:32,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:32,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287401384] [2024-11-12 13:21:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:32,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:32,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:32,017 INFO L87 Difference]: Start difference. First operand 408 states and 505 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:32,085 INFO L93 Difference]: Finished difference Result 408 states and 503 transitions. [2024-11-12 13:21:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 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 36 [2024-11-12 13:21:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:32,086 INFO L225 Difference]: With dead ends: 408 [2024-11-12 13:21:32,086 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 13:21:32,087 INFO L434 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-11-12 13:21:32,087 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 177 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:32,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 175 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 13:21:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 336. [2024-11-12 13:21:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 285 states have (on average 1.3894736842105264) internal successors, (396), 323 states have internal predecessors, (396), 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-11-12 13:21:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 414 transitions. [2024-11-12 13:21:32,092 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 414 transitions. Word has length 36 [2024-11-12 13:21:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:32,092 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 414 transitions. [2024-11-12 13:21:32,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 414 transitions. [2024-11-12 13:21:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:21:32,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:32,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 13:21:32,093 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1314168092, now seen corresponding path program 1 times [2024-11-12 13:21:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573367999] [2024-11-12 13:21:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:32,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573367999] [2024-11-12 13:21:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573367999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:32,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766095664] [2024-11-12 13:21:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:32,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:32,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:32,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:32,432 INFO L87 Difference]: Start difference. First operand 336 states and 414 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:32,783 INFO L93 Difference]: Finished difference Result 451 states and 519 transitions. [2024-11-12 13:21:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:21:32,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 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 49 [2024-11-12 13:21:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:32,784 INFO L225 Difference]: With dead ends: 451 [2024-11-12 13:21:32,784 INFO L226 Difference]: Without dead ends: 451 [2024-11-12 13:21:32,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:32,785 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 273 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:32,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 730 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-12 13:21:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 370. [2024-11-12 13:21:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 319 states have (on average 1.3667711598746082) internal successors, (436), 357 states have internal predecessors, (436), 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-11-12 13:21:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 454 transitions. [2024-11-12 13:21:32,793 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 454 transitions. Word has length 49 [2024-11-12 13:21:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 454 transitions. [2024-11-12 13:21:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 454 transitions. [2024-11-12 13:21:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:21:32,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:32,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:32,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 13:21:32,795 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2078878253, now seen corresponding path program 1 times [2024-11-12 13:21:32,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:32,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879512032] [2024-11-12 13:21:32,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879512032] [2024-11-12 13:21:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879512032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:33,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548582140] [2024-11-12 13:21:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:33,294 INFO L87 Difference]: Start difference. First operand 370 states and 454 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:33,537 INFO L93 Difference]: Finished difference Result 397 states and 481 transitions. [2024-11-12 13:21:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:21:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 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 50 [2024-11-12 13:21:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:33,539 INFO L225 Difference]: With dead ends: 397 [2024-11-12 13:21:33,539 INFO L226 Difference]: Without dead ends: 397 [2024-11-12 13:21:33,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:33,540 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 75 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:33,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 872 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-12 13:21:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 388. [2024-11-12 13:21:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.3471810089020773) internal successors, (454), 375 states have internal predecessors, (454), 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-11-12 13:21:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 472 transitions. [2024-11-12 13:21:33,546 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 472 transitions. Word has length 50 [2024-11-12 13:21:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:33,546 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 472 transitions. [2024-11-12 13:21:33,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 472 transitions. [2024-11-12 13:21:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:21:33,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:33,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 13:21:33,548 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -457671058, now seen corresponding path program 1 times [2024-11-12 13:21:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454831298] [2024-11-12 13:21:33,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:34,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454831298] [2024-11-12 13:21:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454831298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:34,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 13:21:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209245678] [2024-11-12 13:21:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:34,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:34,247 INFO L87 Difference]: Start difference. First operand 388 states and 472 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:34,626 INFO L93 Difference]: Finished difference Result 404 states and 488 transitions. [2024-11-12 13:21:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 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 50 [2024-11-12 13:21:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:34,627 INFO L225 Difference]: With dead ends: 404 [2024-11-12 13:21:34,628 INFO L226 Difference]: Without dead ends: 404 [2024-11-12 13:21:34,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:34,629 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 53 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:34,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1415 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-12 13:21:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 388. [2024-11-12 13:21:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.3471810089020773) internal successors, (454), 375 states have internal predecessors, (454), 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-11-12 13:21:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 472 transitions. [2024-11-12 13:21:34,636 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 472 transitions. Word has length 50 [2024-11-12 13:21:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:34,636 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 472 transitions. [2024-11-12 13:21:34,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 472 transitions. [2024-11-12 13:21:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:34,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:34,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:34,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 13:21:34,636 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 267567628, now seen corresponding path program 1 times [2024-11-12 13:21:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459970848] [2024-11-12 13:21:34,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:34,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:34,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459970848] [2024-11-12 13:21:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459970848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:34,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706165678] [2024-11-12 13:21:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:34,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:34,860 INFO L87 Difference]: Start difference. First operand 388 states and 472 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:35,109 INFO L93 Difference]: Finished difference Result 631 states and 769 transitions. [2024-11-12 13:21:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:35,111 INFO L225 Difference]: With dead ends: 631 [2024-11-12 13:21:35,111 INFO L226 Difference]: Without dead ends: 631 [2024-11-12 13:21:35,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:35,111 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 393 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:35,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 774 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-12 13:21:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 452. [2024-11-12 13:21:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 435 states have internal predecessors, (530), 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-11-12 13:21:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 560 transitions. [2024-11-12 13:21:35,118 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 560 transitions. Word has length 51 [2024-11-12 13:21:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:35,118 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 560 transitions. [2024-11-12 13:21:35,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 560 transitions. [2024-11-12 13:21:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:35,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:35,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 13:21:35,119 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:35,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 267567629, now seen corresponding path program 1 times [2024-11-12 13:21:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931708701] [2024-11-12 13:21:35,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931708701] [2024-11-12 13:21:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931708701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:35,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583463961] [2024-11-12 13:21:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:35,578 INFO L87 Difference]: Start difference. First operand 452 states and 560 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:36,030 INFO L93 Difference]: Finished difference Result 674 states and 827 transitions. [2024-11-12 13:21:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:36,033 INFO L225 Difference]: With dead ends: 674 [2024-11-12 13:21:36,033 INFO L226 Difference]: Without dead ends: 674 [2024-11-12 13:21:36,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:36,033 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 364 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:36,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1032 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-12 13:21:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 502. [2024-11-12 13:21:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 440 states have (on average 1.3636363636363635) internal successors, (600), 483 states have internal predecessors, (600), 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-11-12 13:21:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2024-11-12 13:21:36,042 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 51 [2024-11-12 13:21:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2024-11-12 13:21:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2024-11-12 13:21:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:36,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:36,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-12 13:21:36,047 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 269414670, now seen corresponding path program 1 times [2024-11-12 13:21:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374200396] [2024-11-12 13:21:36,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:36,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374200396] [2024-11-12 13:21:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374200396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412308555] [2024-11-12 13:21:36,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:36,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:36,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:36,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:21:36,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:21:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:37,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:21:37,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:37,428 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-11-12 13:21:37,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:37,652 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-11-12 13:21:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:37,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412308555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:37,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2024-11-12 13:21:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956850767] [2024-11-12 13:21:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:37,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:21:37,683 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:38,158 INFO L93 Difference]: Finished difference Result 739 states and 924 transitions. [2024-11-12 13:21:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:21:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:38,160 INFO L225 Difference]: With dead ends: 739 [2024-11-12 13:21:38,160 INFO L226 Difference]: Without dead ends: 739 [2024-11-12 13:21:38,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:21:38,161 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 330 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:38,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 795 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-12 13:21:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 561. [2024-11-12 13:21:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 491 states have (on average 1.3625254582484725) internal successors, (669), 538 states have internal predecessors, (669), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-12 13:21:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 717 transitions. [2024-11-12 13:21:38,169 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 717 transitions. Word has length 51 [2024-11-12 13:21:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:38,169 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 717 transitions. [2024-11-12 13:21:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 717 transitions. [2024-11-12 13:21:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:38,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:38,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:38,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-12 13:21:38,375 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 269414671, now seen corresponding path program 1 times [2024-11-12 13:21:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123905600] [2024-11-12 13:21:38,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:39,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:39,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123905600] [2024-11-12 13:21:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123905600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590096043] [2024-11-12 13:21:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:39,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:21:39,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:21:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:39,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 13:21:39,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:39,814 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-11-12 13:21:40,187 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-11-12 13:21:40,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:21:40,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:40,386 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-11-12 13:21:40,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:40,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-12 13:21:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:40,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590096043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:40,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 28 [2024-11-12 13:21:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765079198] [2024-11-12 13:21:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:40,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:21:40,453 INFO L87 Difference]: Start difference. First operand 561 states and 717 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:40,952 INFO L93 Difference]: Finished difference Result 789 states and 994 transitions. [2024-11-12 13:21:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:21:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:40,955 INFO L225 Difference]: With dead ends: 789 [2024-11-12 13:21:40,955 INFO L226 Difference]: Without dead ends: 789 [2024-11-12 13:21:40,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:21:40,955 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 295 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:40,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1042 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-12 13:21:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 600. [2024-11-12 13:21:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 526 states have (on average 1.3745247148288973) internal successors, (723), 575 states have internal predecessors, (723), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 15 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-12 13:21:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 777 transitions. [2024-11-12 13:21:40,964 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 777 transitions. Word has length 51 [2024-11-12 13:21:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 777 transitions. [2024-11-12 13:21:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 777 transitions. [2024-11-12 13:21:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:40,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:40,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:40,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:21:41,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-12 13:21:41,170 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1432637723, now seen corresponding path program 1 times [2024-11-12 13:21:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:41,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140010648] [2024-11-12 13:21:41,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:41,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:41,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140010648] [2024-11-12 13:21:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140010648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096047105] [2024-11-12 13:21:41,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:41,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:21:41,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:21:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:41,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 13:21:41,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:41,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:21:41,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:41,953 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 29 treesize of output 22 [2024-11-12 13:21:42,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-12 13:21:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:42,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096047105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:42,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-11-12 13:21:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933998014] [2024-11-12 13:21:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:21:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:21:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:21:42,097 INFO L87 Difference]: Start difference. First operand 600 states and 777 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:42,852 INFO L93 Difference]: Finished difference Result 1014 states and 1292 transitions. [2024-11-12 13:21:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:21:42,853 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:42,861 INFO L225 Difference]: With dead ends: 1014 [2024-11-12 13:21:42,861 INFO L226 Difference]: Without dead ends: 1014 [2024-11-12 13:21:42,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:21:42,862 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 297 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:42,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 2507 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-12 13:21:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 727. [2024-11-12 13:21:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 645 states have (on average 1.365891472868217) internal successors, (881), 698 states have internal predecessors, (881), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-11-12 13:21:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 947 transitions. [2024-11-12 13:21:42,892 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 947 transitions. Word has length 51 [2024-11-12 13:21:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:42,893 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 947 transitions. [2024-11-12 13:21:42,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 947 transitions. [2024-11-12 13:21:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:42,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:42,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:42,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:43,098 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1432637722, now seen corresponding path program 1 times [2024-11-12 13:21:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480939569] [2024-11-12 13:21:43,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480939569] [2024-11-12 13:21:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480939569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:43,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280556400] [2024-11-12 13:21:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:43,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:43,768 INFO L87 Difference]: Start difference. First operand 727 states and 947 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:44,544 INFO L93 Difference]: Finished difference Result 1077 states and 1372 transitions. [2024-11-12 13:21:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 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 51 [2024-11-12 13:21:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:44,548 INFO L225 Difference]: With dead ends: 1077 [2024-11-12 13:21:44,548 INFO L226 Difference]: Without dead ends: 1077 [2024-11-12 13:21:44,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:44,549 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 370 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:44,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1486 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-12 13:21:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 745. [2024-11-12 13:21:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 663 states have (on average 1.3755656108597285) internal successors, (912), 716 states have internal predecessors, (912), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-11-12 13:21:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 978 transitions. [2024-11-12 13:21:44,566 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 978 transitions. Word has length 51 [2024-11-12 13:21:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:44,567 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 978 transitions. [2024-11-12 13:21:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 978 transitions. [2024-11-12 13:21:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:44,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:44,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-12 13:21:44,569 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:44,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash -295339386, now seen corresponding path program 1 times [2024-11-12 13:21:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971120293] [2024-11-12 13:21:44,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971120293] [2024-11-12 13:21:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971120293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 13:21:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875285935] [2024-11-12 13:21:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:21:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:44,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:21:44,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:44,982 INFO L87 Difference]: Start difference. First operand 745 states and 978 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:45,370 INFO L93 Difference]: Finished difference Result 1269 states and 1656 transitions. [2024-11-12 13:21:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:21:45,371 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 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 52 [2024-11-12 13:21:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:45,375 INFO L225 Difference]: With dead ends: 1269 [2024-11-12 13:21:45,375 INFO L226 Difference]: Without dead ends: 1269 [2024-11-12 13:21:45,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:21:45,376 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 404 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:45,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1508 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-12 13:21:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1046. [2024-11-12 13:21:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 932 states have (on average 1.3873390557939915) internal successors, (1293), 1001 states have internal predecessors, (1293), 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-11-12 13:21:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1407 transitions. [2024-11-12 13:21:45,394 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1407 transitions. Word has length 52 [2024-11-12 13:21:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:45,394 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1407 transitions. [2024-11-12 13:21:45,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1407 transitions. [2024-11-12 13:21:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:45,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:45,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:45,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-12 13:21:45,396 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:45,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -238081084, now seen corresponding path program 1 times [2024-11-12 13:21:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:45,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337944664] [2024-11-12 13:21:45,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337944664] [2024-11-12 13:21:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337944664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:45,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189541582] [2024-11-12 13:21:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:45,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:45,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:45,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:45,618 INFO L87 Difference]: Start difference. First operand 1046 states and 1407 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:45,829 INFO L93 Difference]: Finished difference Result 1519 states and 2029 transitions. [2024-11-12 13:21:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:21:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 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 52 [2024-11-12 13:21:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:45,833 INFO L225 Difference]: With dead ends: 1519 [2024-11-12 13:21:45,833 INFO L226 Difference]: Without dead ends: 1519 [2024-11-12 13:21:45,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:45,834 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 300 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:45,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1165 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-12 13:21:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1288. [2024-11-12 13:21:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1146 states have (on average 1.3979057591623036) internal successors, (1602), 1229 states have internal predecessors, (1602), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2024-11-12 13:21:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1758 transitions. [2024-11-12 13:21:45,850 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1758 transitions. Word has length 52 [2024-11-12 13:21:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:45,851 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1758 transitions. [2024-11-12 13:21:45,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1758 transitions. [2024-11-12 13:21:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:45,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:45,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:45,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-12 13:21:45,852 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:45,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1519356017, now seen corresponding path program 1 times [2024-11-12 13:21:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850111425] [2024-11-12 13:21:45,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850111425] [2024-11-12 13:21:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850111425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:46,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253788195] [2024-11-12 13:21:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:46,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:46,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:46,023 INFO L87 Difference]: Start difference. First operand 1288 states and 1758 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:46,283 INFO L93 Difference]: Finished difference Result 1502 states and 2006 transitions. [2024-11-12 13:21:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:21:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 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 52 [2024-11-12 13:21:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:46,287 INFO L225 Difference]: With dead ends: 1502 [2024-11-12 13:21:46,287 INFO L226 Difference]: Without dead ends: 1502 [2024-11-12 13:21:46,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:46,288 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 375 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:46,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1226 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-12 13:21:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1084. [2024-11-12 13:21:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 966 states have (on average 1.3933747412008282) internal successors, (1346), 1037 states have internal predecessors, (1346), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-12 13:21:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1466 transitions. [2024-11-12 13:21:46,300 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1466 transitions. Word has length 52 [2024-11-12 13:21:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:46,301 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1466 transitions. [2024-11-12 13:21:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1466 transitions. [2024-11-12 13:21:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:46,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:46,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-12 13:21:46,301 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:46,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1462097715, now seen corresponding path program 1 times [2024-11-12 13:21:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469816478] [2024-11-12 13:21:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469816478] [2024-11-12 13:21:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469816478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:21:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103889161] [2024-11-12 13:21:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:46,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:21:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:21:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:46,470 INFO L87 Difference]: Start difference. First operand 1084 states and 1466 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:46,693 INFO L93 Difference]: Finished difference Result 1335 states and 1769 transitions. [2024-11-12 13:21:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:21:46,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 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 52 [2024-11-12 13:21:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:46,696 INFO L225 Difference]: With dead ends: 1335 [2024-11-12 13:21:46,696 INFO L226 Difference]: Without dead ends: 1335 [2024-11-12 13:21:46,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:46,697 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 257 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:46,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1191 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2024-11-12 13:21:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 879. [2024-11-12 13:21:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 844 states have internal predecessors, (1088), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-12 13:21:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1172 transitions. [2024-11-12 13:21:46,712 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1172 transitions. Word has length 52 [2024-11-12 13:21:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1172 transitions. [2024-11-12 13:21:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1172 transitions. [2024-11-12 13:21:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:46,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:46,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-12 13:21:46,713 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash -351851286, now seen corresponding path program 1 times [2024-11-12 13:21:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812218736] [2024-11-12 13:21:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812218736] [2024-11-12 13:21:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812218736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 13:21:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282163787] [2024-11-12 13:21:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:47,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:21:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:21:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:47,192 INFO L87 Difference]: Start difference. First operand 879 states and 1172 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:47,763 INFO L93 Difference]: Finished difference Result 1317 states and 1724 transitions. [2024-11-12 13:21:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:21:47,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 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 54 [2024-11-12 13:21:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:47,766 INFO L225 Difference]: With dead ends: 1317 [2024-11-12 13:21:47,766 INFO L226 Difference]: Without dead ends: 1317 [2024-11-12 13:21:47,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:21:47,767 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 460 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1326 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-12 13:21:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1102. [2024-11-12 13:21:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 984 states have (on average 1.3922764227642277) internal successors, (1370), 1055 states have internal predecessors, (1370), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-12 13:21:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1490 transitions. [2024-11-12 13:21:47,778 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1490 transitions. Word has length 54 [2024-11-12 13:21:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1490 transitions. [2024-11-12 13:21:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1490 transitions. [2024-11-12 13:21:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:47,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:47,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-12 13:21:47,779 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1161197912, now seen corresponding path program 1 times [2024-11-12 13:21:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709712301] [2024-11-12 13:21:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709712301] [2024-11-12 13:21:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709712301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225315212] [2024-11-12 13:21:48,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:48,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:48,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:21:48,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:21:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:21:48,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:49,048 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-11-12 13:21:49,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:49,203 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-11-12 13:21:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:49,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225315212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 27 [2024-11-12 13:21:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826701756] [2024-11-12 13:21:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:49,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:21:49,231 INFO L87 Difference]: Start difference. First operand 1102 states and 1490 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:49,572 INFO L93 Difference]: Finished difference Result 1424 states and 1888 transitions. [2024-11-12 13:21:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 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 54 [2024-11-12 13:21:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:49,575 INFO L225 Difference]: With dead ends: 1424 [2024-11-12 13:21:49,575 INFO L226 Difference]: Without dead ends: 1424 [2024-11-12 13:21:49,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:21:49,576 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 359 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:49,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 938 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-12 13:21:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1200. [2024-11-12 13:21:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1070 states have (on average 1.3953271028037384) internal successors, (1493), 1147 states have internal predecessors, (1493), 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-11-12 13:21:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1631 transitions. [2024-11-12 13:21:49,598 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1631 transitions. Word has length 54 [2024-11-12 13:21:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:49,598 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1631 transitions. [2024-11-12 13:21:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1631 transitions. [2024-11-12 13:21:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:49,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:49,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:49,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 13:21:49,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-12 13:21:49,804 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 189205427, now seen corresponding path program 1 times [2024-11-12 13:21:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432483877] [2024-11-12 13:21:49,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432483877] [2024-11-12 13:21:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432483877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031935536] [2024-11-12 13:21:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:50,065 INFO L87 Difference]: Start difference. First operand 1200 states and 1631 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:50,313 INFO L93 Difference]: Finished difference Result 1424 states and 1888 transitions. [2024-11-12 13:21:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 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 54 [2024-11-12 13:21:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:50,317 INFO L225 Difference]: With dead ends: 1424 [2024-11-12 13:21:50,317 INFO L226 Difference]: Without dead ends: 1424 [2024-11-12 13:21:50,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:50,317 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 416 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:50,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 865 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-12 13:21:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 996. [2024-11-12 13:21:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 890 states have (on average 1.3898876404494382) internal successors, (1237), 955 states have internal predecessors, (1237), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-11-12 13:21:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1339 transitions. [2024-11-12 13:21:50,329 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1339 transitions. Word has length 54 [2024-11-12 13:21:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1339 transitions. [2024-11-12 13:21:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1339 transitions. [2024-11-12 13:21:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:50,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:50,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:50,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-12 13:21:50,330 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:50,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -620141199, now seen corresponding path program 1 times [2024-11-12 13:21:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811295419] [2024-11-12 13:21:50,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811295419] [2024-11-12 13:21:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811295419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971385129] [2024-11-12 13:21:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:50,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:50,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:50,638 INFO L87 Difference]: Start difference. First operand 996 states and 1339 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:51,034 INFO L93 Difference]: Finished difference Result 1213 states and 1576 transitions. [2024-11-12 13:21:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:21:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 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 54 [2024-11-12 13:21:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:51,037 INFO L225 Difference]: With dead ends: 1213 [2024-11-12 13:21:51,037 INFO L226 Difference]: Without dead ends: 1213 [2024-11-12 13:21:51,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:21:51,038 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 305 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:51,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1725 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-12 13:21:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 887. [2024-11-12 13:21:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 793 states have (on average 1.3871374527112232) internal successors, (1100), 852 states have internal predecessors, (1100), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-12 13:21:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1184 transitions. [2024-11-12 13:21:51,048 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1184 transitions. Word has length 54 [2024-11-12 13:21:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:51,049 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1184 transitions. [2024-11-12 13:21:51,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1184 transitions. [2024-11-12 13:21:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:51,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:51,050 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-12 13:21:51,050 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:51,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:51,050 INFO L85 PathProgramCache]: Analyzing trace with hash 839700204, now seen corresponding path program 1 times [2024-11-12 13:21:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429811630] [2024-11-12 13:21:51,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:21:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:21:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429811630] [2024-11-12 13:21:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429811630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 13:21:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134258830] [2024-11-12 13:21:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:51,424 INFO L87 Difference]: Start difference. First operand 887 states and 1184 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-11-12 13:21:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:51,712 INFO L93 Difference]: Finished difference Result 1176 states and 1539 transitions. [2024-11-12 13:21:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 56 [2024-11-12 13:21:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:51,714 INFO L225 Difference]: With dead ends: 1176 [2024-11-12 13:21:51,714 INFO L226 Difference]: Without dead ends: 1176 [2024-11-12 13:21:51,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:51,715 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 280 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:51,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1362 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-12 13:21:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 972. [2024-11-12 13:21:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 866 states have (on average 1.3856812933025404) internal successors, (1200), 931 states have internal predecessors, (1200), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-11-12 13:21:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1302 transitions. [2024-11-12 13:21:51,724 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1302 transitions. Word has length 56 [2024-11-12 13:21:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:51,724 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1302 transitions. [2024-11-12 13:21:51,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-11-12 13:21:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1302 transitions. [2024-11-12 13:21:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:51,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:51,725 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-11-12 13:21:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-12 13:21:51,725 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-12 13:21:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -954367591, now seen corresponding path program 1 times [2024-11-12 13:21:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746607859] [2024-11-12 13:21:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 13:21:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:21:52,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746607859] [2024-11-12 13:21:52,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746607859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391912551] [2024-11-12 13:21:52,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:52,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:52,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:52,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:21:52,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:21:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-12 13:21:52,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:52,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:52,512 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-11-12 13:21:52,587 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2024-11-12 13:21:52,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-11-12 13:21:56,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:56,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-12 13:21:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:56,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:56,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391912551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:56,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:21:56,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2024-11-12 13:21:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505723261] [2024-11-12 13:21:56,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:56,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:21:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:21:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2024-11-12 13:21:56,924 INFO L87 Difference]: Start difference. First operand 972 states and 1302 transitions. Second operand has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:05,493 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-11-12 13:22:17,669 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-11-12 13:22:21,730 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-11-12 13:22:25,748 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-11-12 13:22:29,766 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-11-12 13:22:33,781 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-11-12 13:22:37,795 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-11-12 13:22:41,821 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-11-12 13:22:45,828 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]