./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:45:46,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:45:46,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:45:46,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:45:46,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:45:47,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:45:47,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:45:47,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:45:47,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:45:47,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:45:47,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:45:47,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:45:47,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:45:47,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:45:47,021 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:45:47,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:45:47,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:45:47,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:45:47,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:45:47,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:45:47,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:45:47,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:45:47,023 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:45:47,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:45:47,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:45:47,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:45:47,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:45:47,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:45:47,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:45:47,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:45:47,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:45:47,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:45:47,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:45:47,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:45:47,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:45:47,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:45:47,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:45:47,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:45:47,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:45:47,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:45:47,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:45:47,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:45:47,029 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2024-10-11 17:45:47,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:45:47,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:45:47,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:45:47,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:45:47,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:45:47,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2024-10-11 17:45:48,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:45:48,989 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:45:48,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2024-10-11 17:45:49,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9a34d376/2e55b79cbc2b490ca39f8fdfb0759234/FLAG75e36dc8e [2024-10-11 17:45:49,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9a34d376/2e55b79cbc2b490ca39f8fdfb0759234 [2024-10-11 17:45:49,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:45:49,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:45:49,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:45:49,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:45:49,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:45:49,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ad060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49, skipping insertion in model container [2024-10-11 17:45:49,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:45:49,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:45:49,754 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:45:49,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:45:49,828 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:45:49,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49 WrapperNode [2024-10-11 17:45:49,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:45:49,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:45:49,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:45:49,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:45:49,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,878 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2024-10-11 17:45:49,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:45:49,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:45:49,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:45:49,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:45:49,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,916 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-11 17:45:49,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:45:49,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:45:49,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:45:49,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:45:49,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (1/1) ... [2024-10-11 17:45:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:45:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:49,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:45:49,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:45:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:45:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:45:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:45:50,113 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:45:50,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:45:50,315 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-11 17:45:50,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:45:50,346 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:45:50,346 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:45:50,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:45:50 BoogieIcfgContainer [2024-10-11 17:45:50,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:45:50,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:45:50,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:45:50,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:45:50,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:45:49" (1/3) ... [2024-10-11 17:45:50,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ff8de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:45:50, skipping insertion in model container [2024-10-11 17:45:50,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:49" (2/3) ... [2024-10-11 17:45:50,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ff8de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:45:50, skipping insertion in model container [2024-10-11 17:45:50,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:45:50" (3/3) ... [2024-10-11 17:45:50,354 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2024-10-11 17:45:50,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:45:50,369 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-11 17:45:50,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:45:50,410 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;@f8f8564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:45:50,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-11 17:45:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 2.176470588235294) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:50,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:50,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:50,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash -997654472, now seen corresponding path program 1 times [2024-10-11 17:45:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478584922] [2024-10-11 17:45:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478584922] [2024-10-11 17:45:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478584922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952959641] [2024-10-11 17:45:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:50,775 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 2.176470588235294) internal successors, (37), 28 states have internal predecessors, (37), 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:50,821 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-10-11 17:45:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:50,830 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:45:50,831 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:45:50,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:50,836 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:50,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:45:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-11 17:45:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.85) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-11 17:45:50,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-10-11 17:45:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:50,880 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-11 17:45:50,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-11 17:45:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:50,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:50,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:50,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:45:50,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:50,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash -995807430, now seen corresponding path program 1 times [2024-10-11 17:45:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287338741] [2024-10-11 17:45:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287338741] [2024-10-11 17:45:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287338741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949676698] [2024-10-11 17:45:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:45:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:45:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:51,079 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:51,115 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-11 17:45:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:45:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:51,117 INFO L225 Difference]: With dead ends: 29 [2024-10-11 17:45:51,117 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 17:45:51,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:51,120 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:51,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 17:45:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 17:45:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.75) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-11 17:45:51,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 6 [2024-10-11 17:45:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:51,131 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-11 17:45:51,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-11 17:45:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:51,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:51,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:51,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:45:51,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:51,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -995807429, now seen corresponding path program 1 times [2024-10-11 17:45:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673733226] [2024-10-11 17:45:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:51,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673733226] [2024-10-11 17:45:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673733226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562512117] [2024-10-11 17:45:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:51,361 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:51,452 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-10-11 17:45:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:51,453 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:45:51,453 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 17:45:51,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:51,455 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:51,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 17:45:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 17:45:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 17:45:51,466 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2024-10-11 17:45:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:51,466 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 17:45:51,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 17:45:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:45:51,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:51,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:51,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:45:51,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -862519198, now seen corresponding path program 1 times [2024-10-11 17:45:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:51,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035931543] [2024-10-11 17:45:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:51,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035931543] [2024-10-11 17:45:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035931543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:51,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:51,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:51,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544937052] [2024-10-11 17:45:51,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:51,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:51,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:51,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:51,653 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:51,705 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-11 17:45:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:45:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:51,707 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:45:51,707 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:45:51,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:51,708 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:51,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:45:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:45:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-11 17:45:51,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 7 [2024-10-11 17:45:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-11 17:45:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-11 17:45:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:45:51,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:51,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:51,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:45:51,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:51,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash -805260896, now seen corresponding path program 1 times [2024-10-11 17:45:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:51,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872195711] [2024-10-11 17:45:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872195711] [2024-10-11 17:45:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872195711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:51,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657750864] [2024-10-11 17:45:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:51,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:51,955 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:51,998 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-10-11 17:45:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:45:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:52,003 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:45:52,003 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:45:52,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:52,004 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:52,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:45:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 17:45:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-11 17:45:52,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 7 [2024-10-11 17:45:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-11 17:45:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-11 17:45:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:45:52,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:52,012 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:52,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:45:52,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 806829021, now seen corresponding path program 1 times [2024-10-11 17:45:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922979306] [2024-10-11 17:45:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922979306] [2024-10-11 17:45:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922979306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734161652] [2024-10-11 17:45:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:52,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:52,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:52,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:45:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:52,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 17:45:52,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:52,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:45:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:45:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:52,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734161652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:52,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-11 17:45:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396142366] [2024-10-11 17:45:52,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:45:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:45:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:45:52,737 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:52,897 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 17:45:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:45:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:45:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:52,898 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:45:52,898 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:45:52,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:45:52,900 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:52,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:45:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-11 17:45:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 17:45:52,903 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 8 [2024-10-11 17:45:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:52,904 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 17:45:52,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 17:45:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:45:52,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:52,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:52,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:53,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:53,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 47790296, now seen corresponding path program 1 times [2024-10-11 17:45:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326607522] [2024-10-11 17:45:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:53,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326607522] [2024-10-11 17:45:53,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326607522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:53,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994511374] [2024-10-11 17:45:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:53,164 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:53,196 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-10-11 17:45:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:45:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:53,198 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:45:53,198 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:45:53,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:53,199 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 40 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:45:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:45:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 17:45:53,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 9 [2024-10-11 17:45:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:53,204 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 17:45:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 17:45:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:45:53,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:53,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:53,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:45:53,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:53,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 47790297, now seen corresponding path program 1 times [2024-10-11 17:45:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973485689] [2024-10-11 17:45:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973485689] [2024-10-11 17:45:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973485689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946718400] [2024-10-11 17:45:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:53,325 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:53,378 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 17:45:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:45:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:53,380 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:45:53,380 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:45:53,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:53,381 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:53,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:45:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-11 17:45:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.6) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-11 17:45:53,386 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 9 [2024-10-11 17:45:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:53,386 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-11 17:45:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-11 17:45:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:45:53,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:53,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:53,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:45:53,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -758105794, now seen corresponding path program 1 times [2024-10-11 17:45:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672176325] [2024-10-11 17:45:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672176325] [2024-10-11 17:45:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672176325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515529957] [2024-10-11 17:45:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:53,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:53,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:53,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:45:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:53,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:45:53,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:45:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:45:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:53,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:53,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515529957] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:53,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:45:53,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 11 [2024-10-11 17:45:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607505683] [2024-10-11 17:45:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:53,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:53,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:45:53,872 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:53,936 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-11 17:45:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:53,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:45:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:53,937 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:45:53,937 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 17:45:53,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:45:53,938 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:53,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 17:45:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-11 17:45:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-11 17:45:53,944 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 9 [2024-10-11 17:45:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-11 17:45:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-11 17:45:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:53,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:53,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:53,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:54,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:54,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1481498544, now seen corresponding path program 1 times [2024-10-11 17:45:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628543190] [2024-10-11 17:45:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628543190] [2024-10-11 17:45:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628543190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:54,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502215306] [2024-10-11 17:45:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:54,175 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:54,192 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-10-11 17:45:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:54,193 INFO L225 Difference]: With dead ends: 28 [2024-10-11 17:45:54,193 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 17:45:54,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:54,194 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:54,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 17:45:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 17:45:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 17:45:54,196 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 10 [2024-10-11 17:45:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 17:45:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 17:45:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:54,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:54,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:54,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:45:54,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1481499196, now seen corresponding path program 1 times [2024-10-11 17:45:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550367612] [2024-10-11 17:45:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550367612] [2024-10-11 17:45:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550367612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:54,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:54,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173883406] [2024-10-11 17:45:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:54,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:54,391 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:54,458 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-11 17:45:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:54,459 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:45:54,459 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:45:54,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:54,460 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:54,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:45:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-11 17:45:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-10-11 17:45:54,464 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 10 [2024-10-11 17:45:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:54,464 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-10-11 17:45:54,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-10-11 17:45:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:54,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:54,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:45:54,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1481499197, now seen corresponding path program 1 times [2024-10-11 17:45:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881916668] [2024-10-11 17:45:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881916668] [2024-10-11 17:45:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881916668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077107762] [2024-10-11 17:45:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:54,617 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:54,658 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-11 17:45:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:54,659 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:45:54,659 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:45:54,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:54,660 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:54,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:45:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 17:45:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-11 17:45:54,664 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 10 [2024-10-11 17:45:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:54,664 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-11 17:45:54,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-11 17:45:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:54,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:54,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:45:54,665 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 672152570, now seen corresponding path program 1 times [2024-10-11 17:45:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250597570] [2024-10-11 17:45:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250597570] [2024-10-11 17:45:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250597570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711674627] [2024-10-11 17:45:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:54,732 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-10-11 17:45:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:54,767 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-11 17:45:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:54,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-10-11 17:45:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:54,768 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:45:54,768 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:45:54,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:54,768 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:54,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:45:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-10-11 17:45:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-10-11 17:45:54,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 10 [2024-10-11 17:45:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:54,771 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-10-11 17:45:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-10-11 17:45:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-10-11 17:45:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:54,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:54,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:45:54,775 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 672152571, now seen corresponding path program 1 times [2024-10-11 17:45:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498974553] [2024-10-11 17:45:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498974553] [2024-10-11 17:45:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498974553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699948447] [2024-10-11 17:45:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:45:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:45:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:54,939 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:54,987 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-11 17:45:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:45:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:54,988 INFO L225 Difference]: With dead ends: 38 [2024-10-11 17:45:54,988 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 17:45:54,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:54,989 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:54,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 17:45:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2024-10-11 17:45:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 17:45:54,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 10 [2024-10-11 17:45:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:54,994 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 17:45:54,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 17:45:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:45:54,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:54,995 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:54,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:45:54,995 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 258656177, now seen corresponding path program 1 times [2024-10-11 17:45:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840916407] [2024-10-11 17:45:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840916407] [2024-10-11 17:45:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840916407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262516319] [2024-10-11 17:45:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:55,060 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:55,083 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-10-11 17:45:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-10-11 17:45:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:55,084 INFO L225 Difference]: With dead ends: 40 [2024-10-11 17:45:55,084 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 17:45:55,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:55,085 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:55,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 17:45:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 17:45:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-11 17:45:55,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 13 [2024-10-11 17:45:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:55,091 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-11 17:45:55,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-11 17:45:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:45:55,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:55,093 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:45:55,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:55,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash 959720755, now seen corresponding path program 1 times [2024-10-11 17:45:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970657932] [2024-10-11 17:45:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970657932] [2024-10-11 17:45:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970657932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:45:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762184172] [2024-10-11 17:45:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:55,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:45:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:45:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:55,239 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:55,286 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-11 17:45:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:45:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2024-10-11 17:45:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:55,287 INFO L225 Difference]: With dead ends: 52 [2024-10-11 17:45:55,287 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 17:45:55,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:55,288 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:55,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 17:45:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-10-11 17:45:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-11 17:45:55,292 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 13 [2024-10-11 17:45:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-11 17:45:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-10-11 17:45:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:45:55,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:55,293 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:45:55,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1217886193, now seen corresponding path program 1 times [2024-10-11 17:45:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876179138] [2024-10-11 17:45:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876179138] [2024-10-11 17:45:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876179138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:45:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429562013] [2024-10-11 17:45:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:55,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:45:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:55,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:45:55,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:55,433 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:55,484 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-10-11 17:45:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:45:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2024-10-11 17:45:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:55,485 INFO L225 Difference]: With dead ends: 60 [2024-10-11 17:45:55,485 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 17:45:55,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:55,486 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:55,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 17:45:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2024-10-11 17:45:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-11 17:45:55,489 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 13 [2024-10-11 17:45:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:55,489 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-11 17:45:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-11 17:45:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:55,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:55,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:55,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:45:55,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:55,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash -572115326, now seen corresponding path program 1 times [2024-10-11 17:45:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:55,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033488599] [2024-10-11 17:45:55,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033488599] [2024-10-11 17:45:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033488599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146930736] [2024-10-11 17:45:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:55,547 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:55,617 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-11 17:45:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:45:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-10-11 17:45:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:55,618 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:45:55,618 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:45:55,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:55,619 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:55,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 61 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:45:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 17:45:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-10-11 17:45:55,626 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 14 [2024-10-11 17:45:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-10-11 17:45:55,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-10-11 17:45:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:55,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:55,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:55,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:45:55,627 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -572115325, now seen corresponding path program 1 times [2024-10-11 17:45:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761351047] [2024-10-11 17:45:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:55,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761351047] [2024-10-11 17:45:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761351047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:55,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:45:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135850282] [2024-10-11 17:45:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:55,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:45:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:55,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:45:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:55,710 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:55,750 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-11 17:45:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:45:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2024-10-11 17:45:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:55,751 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:45:55,751 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:45:55,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:55,752 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:55,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:45:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:45:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-10-11 17:45:55,759 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 14 [2024-10-11 17:45:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:55,759 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-11 17:45:55,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-10-11 17:45:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:55,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:55,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:45:55,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -313949887, now seen corresponding path program 1 times [2024-10-11 17:45:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121830994] [2024-10-11 17:45:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121830994] [2024-10-11 17:45:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121830994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:45:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760317745] [2024-10-11 17:45:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:45:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:45:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:45:56,133 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:56,256 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-10-11 17:45:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:45:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 14 [2024-10-11 17:45:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:56,257 INFO L225 Difference]: With dead ends: 58 [2024-10-11 17:45:56,257 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 17:45:56,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:45:56,258 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:56,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 17:45:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 17:45:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-10-11 17:45:56,261 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 14 [2024-10-11 17:45:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-10-11 17:45:56,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-10-11 17:45:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:45:56,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:56,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:45:56,262 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -555707143, now seen corresponding path program 1 times [2024-10-11 17:45:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660010282] [2024-10-11 17:45:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660010282] [2024-10-11 17:45:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660010282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:56,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908668552] [2024-10-11 17:45:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:56,370 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:56,386 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-10-11 17:45:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-10-11 17:45:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:56,387 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:45:56,387 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:45:56,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:56,388 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:56,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:45:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 17:45:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-11 17:45:56,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2024-10-11 17:45:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:56,393 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-11 17:45:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-11 17:45:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:45:56,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:56,394 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:45:56,394 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1991964815, now seen corresponding path program 1 times [2024-10-11 17:45:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898615988] [2024-10-11 17:45:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:56,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898615988] [2024-10-11 17:45:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898615988] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309542225] [2024-10-11 17:45:56,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:56,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:56,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:56,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:56,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:45:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:56,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 17:45:56,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:56,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:56,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:45:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309542225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:56,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-11 17:45:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266288085] [2024-10-11 17:45:56,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:45:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:45:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:45:56,897 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:57,040 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-10-11 17:45:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:45:57,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 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 15 [2024-10-11 17:45:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:57,041 INFO L225 Difference]: With dead ends: 45 [2024-10-11 17:45:57,041 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 17:45:57,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:45:57,042 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:57,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 17:45:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2024-10-11 17:45:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 17:45:57,043 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 15 [2024-10-11 17:45:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:57,044 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 17:45:57,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 17:45:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:45:57,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:57,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:57,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:45:57,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:57,249 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:57,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1621367111, now seen corresponding path program 1 times [2024-10-11 17:45:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:57,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454476232] [2024-10-11 17:45:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:57,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454476232] [2024-10-11 17:45:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454476232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:57,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103743411] [2024-10-11 17:45:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:57,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:57,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:57,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:45:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:57,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 17:45:57,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:57,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:45:57,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:45:57,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:45:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:57,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:58,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:45:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103743411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:58,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-10-11 17:45:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322515414] [2024-10-11 17:45:58,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:58,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:45:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:45:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:45:58,071 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:58,244 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 17:45:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:45:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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 16 [2024-10-11 17:45:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:58,245 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:45:58,245 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 17:45:58,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:45:58,246 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:58,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:58,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 17:45:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-11 17:45:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-11 17:45:58,247 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2024-10-11 17:45:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:58,247 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-11 17:45:58,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-11 17:45:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:45:58,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:58,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:58,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:45:58,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 17:45:58,453 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:45:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1557687232, now seen corresponding path program 1 times [2024-10-11 17:45:58,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:58,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385922597] [2024-10-11 17:45:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385922597] [2024-10-11 17:45:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385922597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608043664] [2024-10-11 17:45:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:59,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:59,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:45:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:59,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 17:45:59,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:59,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:45:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:45:59,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:45:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:59,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:00,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:00,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608043664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:00,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2024-10-11 17:46:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363202837] [2024-10-11 17:46:00,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:00,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 17:46:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 17:46:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 17:46:00,401 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:01,284 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-11 17:46:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 17:46:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 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 17 [2024-10-11 17:46:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:01,285 INFO L225 Difference]: With dead ends: 70 [2024-10-11 17:46:01,285 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 17:46:01,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=287, Invalid=2575, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 17:46:01,286 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:01,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 17:46:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2024-10-11 17:46:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-10-11 17:46:01,288 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 17 [2024-10-11 17:46:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:01,289 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-10-11 17:46:01,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-10-11 17:46:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:46:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:01,289 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:01,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:46:01,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 17:46:01,494 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:01,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash 945405031, now seen corresponding path program 2 times [2024-10-11 17:46:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:01,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372037192] [2024-10-11 17:46:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372037192] [2024-10-11 17:46:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372037192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254451191] [2024-10-11 17:46:01,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:01,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:01,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:01,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:46:01,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:01,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:01,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 17:46:01,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:01,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 17:46:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:01,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:01,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-11 17:46:01,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 17:46:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254451191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:02,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-10-11 17:46:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458049979] [2024-10-11 17:46:02,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 17:46:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 17:46:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:46:02,018 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:02,153 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-11 17:46:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:46:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 19 [2024-10-11 17:46:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:02,154 INFO L225 Difference]: With dead ends: 90 [2024-10-11 17:46:02,154 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 17:46:02,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:46:02,155 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:02,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 218 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 17:46:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2024-10-11 17:46:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 69 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-10-11 17:46:02,157 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 19 [2024-10-11 17:46:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-10-11 17:46:02,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-10-11 17:46:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:46:02,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:02,158 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:02,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:02,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 17:46:02,359 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:02,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1007300987, now seen corresponding path program 3 times [2024-10-11 17:46:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:02,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680230509] [2024-10-11 17:46:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:02,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680230509] [2024-10-11 17:46:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680230509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029248037] [2024-10-11 17:46:02,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:02,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:02,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:02,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:46:02,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 17:46:02,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:02,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 17:46:02,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:02,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:02,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:46:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029248037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:03,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-10-11 17:46:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877918637] [2024-10-11 17:46:03,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:46:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:46:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:46:03,011 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,290 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2024-10-11 17:46:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:46:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 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 21 [2024-10-11 17:46:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,291 INFO L225 Difference]: With dead ends: 102 [2024-10-11 17:46:03,291 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 17:46:03,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:46:03,292 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 243 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 17:46:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2024-10-11 17:46:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-10-11 17:46:03,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 21 [2024-10-11 17:46:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,294 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-10-11 17:46:03,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-10-11 17:46:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:46:03,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,295 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:03,500 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash 531408733, now seen corresponding path program 4 times [2024-10-11 17:46:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609229194] [2024-10-11 17:46:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609229194] [2024-10-11 17:46:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609229194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058217525] [2024-10-11 17:46:03,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:46:03,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:03,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:03,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:03,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:46:03,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:46:03,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:03,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 17:46:03,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:03,901 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 14 treesize of output 10 [2024-10-11 17:46:04,560 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-11 17:46:04,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-10-11 17:46:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:46:04,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:05,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-10-11 17:46:05,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2024-10-11 17:46:05,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:46:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:46:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058217525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:05,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2024-10-11 17:46:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019506420] [2024-10-11 17:46:05,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 17:46:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 17:46:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 17:46:05,245 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 36 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:06,469 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2024-10-11 17:46:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 17:46:06,469 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 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 25 [2024-10-11 17:46:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:06,470 INFO L225 Difference]: With dead ends: 118 [2024-10-11 17:46:06,470 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 17:46:06,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=335, Invalid=2419, Unknown=2, NotChecked=0, Total=2756 [2024-10-11 17:46:06,471 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:06,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 184 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:46:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 17:46:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2024-10-11 17:46:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-10-11 17:46:06,474 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 25 [2024-10-11 17:46:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-10-11 17:46:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-10-11 17:46:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:46:06,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:06,475 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:06,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 17:46:06,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 17:46:06,680 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:06,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1712940160, now seen corresponding path program 2 times [2024-10-11 17:46:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452235085] [2024-10-11 17:46:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452235085] [2024-10-11 17:46:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452235085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029919953] [2024-10-11 17:46:07,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:07,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:07,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:07,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:46:07,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:07,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:07,709 WARN L253 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-10-11 17:46:07,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:07,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-11 17:46:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:07,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-11 17:46:08,723 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-11 17:46:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:08,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:09,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029919953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:10,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 57 [2024-10-11 17:46:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879660853] [2024-10-11 17:46:10,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-11 17:46:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:10,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-11 17:46:10,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3205, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 17:46:10,051 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:12,463 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2024-10-11 17:46:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 17:46:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 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 29 [2024-10-11 17:46:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:12,465 INFO L225 Difference]: With dead ends: 126 [2024-10-11 17:46:12,465 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 17:46:12,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=657, Invalid=7715, Unknown=0, NotChecked=0, Total=8372 [2024-10-11 17:46:12,467 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:12,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:46:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 17:46:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-10-11 17:46:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-10-11 17:46:12,470 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 29 [2024-10-11 17:46:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:12,470 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-10-11 17:46:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-10-11 17:46:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:46:12,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:12,471 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:12,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:46:12,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:46:12,676 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:12,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1438968404, now seen corresponding path program 1 times [2024-10-11 17:46:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814096866] [2024-10-11 17:46:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814096866] [2024-10-11 17:46:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814096866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104013383] [2024-10-11 17:46:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:13,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:13,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:46:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:13,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-11 17:46:13,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:13,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:13,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:46:13,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:46:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:15,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:16,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104013383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:16,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 49 [2024-10-11 17:46:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536041469] [2024-10-11 17:46:16,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-11 17:46:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-11 17:46:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2327, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 17:46:16,216 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:19,147 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2024-10-11 17:46:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 17:46:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 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 29 [2024-10-11 17:46:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:19,148 INFO L225 Difference]: With dead ends: 151 [2024-10-11 17:46:19,148 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 17:46:19,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=837, Invalid=7905, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 17:46:19,151 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:19,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 189 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:46:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 17:46:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 91. [2024-10-11 17:46:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 90 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-10-11 17:46:19,153 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2024-10-11 17:46:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:19,153 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-10-11 17:46:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-10-11 17:46:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:46:19,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:19,155 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:19,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:19,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 17:46:19,358 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1717469792, now seen corresponding path program 3 times [2024-10-11 17:46:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948679084] [2024-10-11 17:46:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948679084] [2024-10-11 17:46:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948679084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710830843] [2024-10-11 17:46:21,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:21,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:21,346 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:21,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:46:21,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-11 17:46:21,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:21,546 WARN L253 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 195 conjuncts are in the unsatisfiable core [2024-10-11 17:46:21,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:21,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:46:21,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:46:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:24,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:27,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710830843] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:27,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 93 [2024-10-11 17:46:27,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053916033] [2024-10-11 17:46:27,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:27,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2024-10-11 17:46:27,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2024-10-11 17:46:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=684, Invalid=8246, Unknown=0, NotChecked=0, Total=8930 [2024-10-11 17:46:27,796 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:42,862 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2024-10-11 17:46:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-10-11 17:46:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 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 47 [2024-10-11 17:46:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:42,864 INFO L225 Difference]: With dead ends: 266 [2024-10-11 17:46:42,864 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 17:46:42,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10879 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4264, Invalid=36742, Unknown=0, NotChecked=0, Total=41006 [2024-10-11 17:46:42,870 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 367 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3365 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 17:46:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 17:46:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2024-10-11 17:46:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.0869565217391304) internal successors, (225), 207 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2024-10-11 17:46:42,877 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 47 [2024-10-11 17:46:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:42,878 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2024-10-11 17:46:42,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2024-10-11 17:46:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:46:42,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:42,880 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:42,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:43,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:43,081 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:43,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 495539082, now seen corresponding path program 2 times [2024-10-11 17:46:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690722838] [2024-10-11 17:46:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 94 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:46:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690722838] [2024-10-11 17:46:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690722838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487849697] [2024-10-11 17:46:44,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:44,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:44,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 17:46:44,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:44,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:44,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-10-11 17:46:44,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:44,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:44,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:46:44,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:46:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:46:46,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:48,343 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:46:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487849697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:48,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 74 [2024-10-11 17:46:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103823342] [2024-10-11 17:46:48,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:48,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-10-11 17:46:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-10-11 17:46:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=5310, Unknown=0, NotChecked=0, Total=5700 [2024-10-11 17:46:48,452 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand has 76 states, 75 states have (on average 1.8) internal successors, (135), 75 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:55,644 INFO L93 Difference]: Finished difference Result 325 states and 338 transitions. [2024-10-11 17:46:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-11 17:46:55,645 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.8) internal successors, (135), 75 states have internal predecessors, (135), 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 47 [2024-10-11 17:46:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:55,646 INFO L225 Difference]: With dead ends: 325 [2024-10-11 17:46:55,646 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 17:46:55,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5675 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2108, Invalid=20542, Unknown=0, NotChecked=0, Total=22650 [2024-10-11 17:46:55,648 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:55,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 394 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 17:46:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 17:46:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 167. [2024-10-11 17:46:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.0783132530120483) internal successors, (179), 166 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2024-10-11 17:46:55,653 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 47 [2024-10-11 17:46:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2024-10-11 17:46:55,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.8) internal successors, (135), 75 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2024-10-11 17:46:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 17:46:55,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:55,654 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:55,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:55,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:55,855 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-11 17:46:55,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash -327353856, now seen corresponding path program 3 times [2024-10-11 17:46:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193699113] [2024-10-11 17:46:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 6 proven. 378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:46:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193699113] [2024-10-11 17:46:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193699113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767197037] [2024-10-11 17:46:59,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:59,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:59,233 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:59,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 17:47:00,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-10-11 17:47:00,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:47:00,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 275 conjuncts are in the unsatisfiable core [2024-10-11 17:47:00,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:47:00,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:47:00,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:47:00,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:47:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:47:05,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:47:11,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:47:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:47:11,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767197037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:47:11,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:47:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41, 41] total 125 [2024-10-11 17:47:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582695934] [2024-10-11 17:47:11,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:47:11,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2024-10-11 17:47:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:47:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2024-10-11 17:47:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=14879, Unknown=0, NotChecked=0, Total=16002 [2024-10-11 17:47:11,608 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand has 127 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 126 states have internal predecessors, (219), 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)