./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:05:32,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:05:32,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:05:32,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:05:32,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:05:32,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:05:32,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:05:32,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:05:32,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:05:32,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:05:32,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:05:32,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:05:32,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:05:32,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:05:32,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:05:32,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:05:32,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:05:32,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:05:32,545 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:05:32,545 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:05:32,546 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:05:32,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:05:32,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:05:32,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:05:32,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:05:32,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:05:32,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:05:32,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:05:32,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:05:32,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:05:32,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:05:32,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:05:32,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:05:32,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:05:32,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:05:32,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:05:32,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:05:32,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:05:32,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:05:32,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f [2024-11-10 15:05:32,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:05:32,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:05:32,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:05:32,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:05:32,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:05:32,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2024-11-10 15:05:34,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:05:34,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:05:34,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2024-11-10 15:05:34,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc45af86f/5d5a478c62614fec8248fe20ee10370d/FLAG2aef71d47 [2024-11-10 15:05:34,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc45af86f/5d5a478c62614fec8248fe20ee10370d [2024-11-10 15:05:34,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:05:34,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:05:34,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:05:34,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:05:34,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:05:34,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:34,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3a882a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34, skipping insertion in model container [2024-11-10 15:05:34,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:34,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:05:34,848 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:05:34,852 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:05:34,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:05:34,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:05:34,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:05:34,956 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:05:34,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34 WrapperNode [2024-11-10 15:05:34,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:05:34,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:05:34,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:05:34,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:05:34,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:34,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:34,998 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2024-11-10 15:05:35,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:05:35,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:05:35,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:05:35,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:05:35,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,044 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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 [1, 3]. [2024-11-10 15:05:35,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:05:35,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:05:35,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:05:35,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:05:35,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (1/1) ... [2024-11-10 15:05:35,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:05:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:35,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:05:35,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:05:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:05:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:05:35,236 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:05:35,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:05:35,447 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: call ULTIMATE.dealloc(main_#t~malloc216#1.base, main_#t~malloc216#1.offset);havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call ULTIMATE.dealloc(main_#t~malloc217#1.base, main_#t~malloc217#1.offset);havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset; [2024-11-10 15:05:35,460 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-10 15:05:35,460 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:05:35,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:05:35,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:05:35,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:05:35 BoogieIcfgContainer [2024-11-10 15:05:35,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:05:35,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:05:35,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:05:35,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:05:35,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:05:34" (1/3) ... [2024-11-10 15:05:35,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383cab2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:05:35, skipping insertion in model container [2024-11-10 15:05:35,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:34" (2/3) ... [2024-11-10 15:05:35,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383cab2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:05:35, skipping insertion in model container [2024-11-10 15:05:35,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:05:35" (3/3) ... [2024-11-10 15:05:35,479 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncat_reverse_alloca.i [2024-11-10 15:05:35,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:05:35,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-10 15:05:35,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:05:35,531 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;@1243a761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:05:35,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 15:05:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 42 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-11-10 15:05:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:05:35,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:35,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:35,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 901908049, now seen corresponding path program 1 times [2024-11-10 15:05:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349814206] [2024-11-10 15:05:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:35,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349814206] [2024-11-10 15:05:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349814206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:05:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093352336] [2024-11-10 15:05:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:35,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:05:35,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:05:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:05:35,885 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 42 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) Second operand has 5 states, 5 states have (on average 1.4) 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-11-10 15:05:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:35,977 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-10 15:05:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:05:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) 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-11-10 15:05:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:35,986 INFO L225 Difference]: With dead ends: 46 [2024-11-10 15:05:35,986 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 15:05:35,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:05:35,993 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:35,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 172 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 15:05:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 15:05:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 42 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-11-10 15:05:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-10 15:05:36,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 7 [2024-11-10 15:05:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:36,027 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-10 15:05:36,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) 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-11-10 15:05:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-10 15:05:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:05:36,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:36,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:05:36,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 902831570, now seen corresponding path program 1 times [2024-11-10 15:05:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906506754] [2024-11-10 15:05:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:36,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906506754] [2024-11-10 15:05:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906506754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:05:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444462701] [2024-11-10 15:05:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:36,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:05:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:05:36,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:05:36,210 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:36,249 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-10 15:05:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:05:36,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:05:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:36,250 INFO L225 Difference]: With dead ends: 42 [2024-11-10 15:05:36,250 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 15:05:36,251 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-11-10 15:05:36,252 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 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-11-10 15:05:36,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 15:05:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 15:05:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 41 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-11-10 15:05:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-10 15:05:36,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 7 [2024-11-10 15:05:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:36,263 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-10 15:05:36,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-10 15:05:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:05:36,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:36,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:36,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:05:36,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:36,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 902831571, now seen corresponding path program 1 times [2024-11-10 15:05:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:36,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133868614] [2024-11-10 15:05:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133868614] [2024-11-10 15:05:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133868614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:36,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:05:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554711522] [2024-11-10 15:05:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:05:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:05:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:05:36,564 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:36,686 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-10 15:05:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:05:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:05:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:36,687 INFO L225 Difference]: With dead ends: 41 [2024-11-10 15:05:36,687 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 15:05:36,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:05:36,688 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:36,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 124 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:05:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 15:05:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 15:05:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-11-10 15:05:36,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 7 [2024-11-10 15:05:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:36,694 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-10 15:05:36,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-10 15:05:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:05:36,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:36,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:05:36,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2105624806, now seen corresponding path program 1 times [2024-11-10 15:05:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721646293] [2024-11-10 15:05:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721646293] [2024-11-10 15:05:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721646293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:36,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:05:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720004219] [2024-11-10 15:05:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:05:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:05:36,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:05:36,717 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:36,741 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-10 15:05:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:05:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:05:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:36,743 INFO L225 Difference]: With dead ends: 43 [2024-11-10 15:05:36,743 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 15:05:36,743 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-11-10 15:05:36,745 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:36,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 15:05:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 15:05:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.72) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-10 15:05:36,749 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 8 [2024-11-10 15:05:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:36,749 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-10 15:05:36,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-10 15:05:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:05:36,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:36,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:36,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:05:36,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:36,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2076992390, now seen corresponding path program 1 times [2024-11-10 15:05:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57596284] [2024-11-10 15:05:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:36,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:36,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57596284] [2024-11-10 15:05:36,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57596284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:05:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808688282] [2024-11-10 15:05:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:36,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:05:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:05:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:05:36,812 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:36,845 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-10 15:05:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:05:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:05:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:36,846 INFO L225 Difference]: With dead ends: 37 [2024-11-10 15:05:36,847 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 15:05:36,848 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-11-10 15:05:36,849 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:36,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 15:05:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 15:05:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.68) 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-11-10 15:05:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-10 15:05:36,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 8 [2024-11-10 15:05:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:36,855 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-10 15:05:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-10 15:05:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:05:36,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:36,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:36,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:05:36,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2076992389, now seen corresponding path program 1 times [2024-11-10 15:05:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272529518] [2024-11-10 15:05:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:36,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272529518] [2024-11-10 15:05:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272529518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:36,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:05:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016901988] [2024-11-10 15:05:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:05:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:05:36,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:05:36,968 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:37,022 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-10 15:05:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:05:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:05:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:37,024 INFO L225 Difference]: With dead ends: 42 [2024-11-10 15:05:37,026 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 15:05:37,026 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-11-10 15:05:37,027 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:37,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 15:05:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-10 15:05:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-10 15:05:37,033 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 8 [2024-11-10 15:05:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 15:05:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-10 15:05:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:05:37,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:37,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:37,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:05:37,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:37,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2076068868, now seen corresponding path program 1 times [2024-11-10 15:05:37,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:37,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175842525] [2024-11-10 15:05:37,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175842525] [2024-11-10 15:05:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175842525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:37,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:37,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:05:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725681432] [2024-11-10 15:05:37,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:37,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:05:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:37,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:05:37,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:05:37,124 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:37,160 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-10 15:05:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:05:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:05:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:37,161 INFO L225 Difference]: With dead ends: 40 [2024-11-10 15:05:37,161 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 15:05:37,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:05:37,162 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:37,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 15:05:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-10 15:05:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.64) 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-11-10 15:05:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-10 15:05:37,166 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 8 [2024-11-10 15:05:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-10 15:05:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-10 15:05:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:05:37,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:37,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:37,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:05:37,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:37,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1913553838, now seen corresponding path program 1 times [2024-11-10 15:05:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544868011] [2024-11-10 15:05:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544868011] [2024-11-10 15:05:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544868011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:05:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106148242] [2024-11-10 15:05:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:37,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:05:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:05:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:05:37,218 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:37,261 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-10 15:05:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:05:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:05:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:37,262 INFO L225 Difference]: With dead ends: 34 [2024-11-10 15:05:37,262 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 15:05:37,263 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-11-10 15:05:37,263 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:37,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 15:05:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-10 15:05:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.48) internal successors, (37), 31 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-11-10 15:05:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-10 15:05:37,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-10 15:05:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:37,269 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-10 15:05:37,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-10 15:05:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:05:37,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:37,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:37,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:05:37,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1913553839, now seen corresponding path program 1 times [2024-11-10 15:05:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589451939] [2024-11-10 15:05:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:37,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589451939] [2024-11-10 15:05:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589451939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:37,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:05:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583496102] [2024-11-10 15:05:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:37,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:05:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:37,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:05:37,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:05:37,559 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:37,662 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-10 15:05:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:05:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:05:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:37,663 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:05:37,663 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 15:05:37,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:05:37,664 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:37,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 115 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:05:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 15:05:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-10 15:05:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 43 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-11-10 15:05:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-11-10 15:05:37,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 11 [2024-11-10 15:05:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:37,668 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-11-10 15:05:37,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-10 15:05:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:05:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:37,669 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:05:37,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -418526859, now seen corresponding path program 1 times [2024-11-10 15:05:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328933646] [2024-11-10 15:05:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328933646] [2024-11-10 15:05:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328933646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620104942] [2024-11-10 15:05:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:37,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:37,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:37,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:37,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:05:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:37,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 15:05:37,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:38,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:05:38,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:38,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:05:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:38,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:38,310 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 7 treesize of output 5 [2024-11-10 15:05:38,420 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 10 treesize of output 8 [2024-11-10 15:05:38,428 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 14 treesize of output 12 [2024-11-10 15:05:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620104942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:38,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-11-10 15:05:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244434360] [2024-11-10 15:05:38,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:05:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:05:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:05:38,485 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:38,708 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-11-10 15:05:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:05:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 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-11-10 15:05:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:38,711 INFO L225 Difference]: With dead ends: 77 [2024-11-10 15:05:38,711 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 15:05:38,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:05:38,712 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 92 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:38,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 283 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:05:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 15:05:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2024-11-10 15:05:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 41 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-11-10 15:05:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-10 15:05:38,720 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 14 [2024-11-10 15:05:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:38,721 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-10 15:05:38,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-10 15:05:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:05:38,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:38,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:38,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:05:38,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:05:38,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:38,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash -89499256, now seen corresponding path program 1 times [2024-11-10 15:05:38,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:38,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552609935] [2024-11-10 15:05:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552609935] [2024-11-10 15:05:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552609935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:05:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019405938] [2024-11-10 15:05:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:38,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:05:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:05:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:05:38,989 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-10 15:05:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:39,033 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-10 15:05:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:05:39,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-11-10 15:05:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:39,034 INFO L225 Difference]: With dead ends: 41 [2024-11-10 15:05:39,034 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 15:05:39,035 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-11-10 15:05:39,035 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:39,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 15:05:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 15:05:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-11-10 15:05:39,042 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 15 [2024-11-10 15:05:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:39,042 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-10 15:05:39,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-10 15:05:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:05:39,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:39,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:39,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:05:39,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:39,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash -89499255, now seen corresponding path program 1 times [2024-11-10 15:05:39,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492367563] [2024-11-10 15:05:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492367563] [2024-11-10 15:05:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492367563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:39,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:05:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986533546] [2024-11-10 15:05:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:39,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:05:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:05:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:05:39,191 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-11-10 15:05:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:39,257 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-11-10 15:05:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:05:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-11-10 15:05:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:39,258 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:05:39,258 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:05:39,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:05:39,259 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:39,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:05:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:05:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-11-10 15:05:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-10 15:05:39,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 15 [2024-11-10 15:05:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:39,266 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-10 15:05:39,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-11-10 15:05:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-10 15:05:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:05:39,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:39,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:05:39,270 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 39583464, now seen corresponding path program 1 times [2024-11-10 15:05:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458785229] [2024-11-10 15:05:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458785229] [2024-11-10 15:05:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458785229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:05:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101554360] [2024-11-10 15:05:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:39,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:05:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:05:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:05:39,522 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-11-10 15:05:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:39,587 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2024-11-10 15:05:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:05:39,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-11-10 15:05:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:39,588 INFO L225 Difference]: With dead ends: 74 [2024-11-10 15:05:39,589 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 15:05:39,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:05:39,590 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:39,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:05:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 15:05:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 46. [2024-11-10 15:05:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-10 15:05:39,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 15 [2024-11-10 15:05:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-10 15:05:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-11-10 15:05:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-10 15:05:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:05:39,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:39,597 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:39,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:05:39,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:39,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash -43620881, now seen corresponding path program 2 times [2024-11-10 15:05:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612367176] [2024-11-10 15:05:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612367176] [2024-11-10 15:05:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612367176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012824707] [2024-11-10 15:05:39,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:05:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:39,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:39,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:05:39,927 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:05:39,927 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:05:39,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 15:05:39,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:39,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:05:40,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:40,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:05:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:40,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:40,247 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 43 treesize of output 39 [2024-11-10 15:05:40,286 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 10 treesize of output 8 [2024-11-10 15:05:40,289 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 14 treesize of output 12 [2024-11-10 15:05:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012824707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:40,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 15:05:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504155633] [2024-11-10 15:05:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:05:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:05:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:05:40,298 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:40,745 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2024-11-10 15:05:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:05:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 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-11-10 15:05:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:40,747 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:05:40,747 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:05:40,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:05:40,748 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 124 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:40,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 367 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:05:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:05:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 40. [2024-11-10 15:05:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-10 15:05:40,755 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 17 [2024-11-10 15:05:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:40,755 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-10 15:05:40,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-10 15:05:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:05:40,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:40,756 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:40,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:05:40,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 15:05:40,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:40,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2067746690, now seen corresponding path program 1 times [2024-11-10 15:05:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485533261] [2024-11-10 15:05:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:40,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485533261] [2024-11-10 15:05:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485533261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:05:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630485158] [2024-11-10 15:05:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:05:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:05:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:05:40,986 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:40,994 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-10 15:05:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:05:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-11-10 15:05:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:40,995 INFO L225 Difference]: With dead ends: 36 [2024-11-10 15:05:40,995 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 15:05:40,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:05:40,997 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:40,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 15:05:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 15:05:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.3125) internal successors, (42), 35 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-11-10 15:05:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-10 15:05:41,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2024-11-10 15:05:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:41,001 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-10 15:05:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-10 15:05:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:05:41,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:41,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:41,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:05:41,002 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash -370610417, now seen corresponding path program 1 times [2024-11-10 15:05:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374613458] [2024-11-10 15:05:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374613458] [2024-11-10 15:05:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374613458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040780755] [2024-11-10 15:05:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:41,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:41,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:41,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:05:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:41,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 15:05:41,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:41,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040780755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:41,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-10 15:05:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031902621] [2024-11-10 15:05:41,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:05:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:05:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:05:41,205 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:41,247 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-10 15:05:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:05:41,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-11-10 15:05:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:41,248 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:05:41,248 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:05:41,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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-11-10 15:05:41,249 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:41,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:05:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2024-11-10 15:05:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-10 15:05:41,256 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 21 [2024-11-10 15:05:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-10 15:05:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-10 15:05:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:05:41,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:41,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:41,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:05:41,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:41,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:41,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -782161285, now seen corresponding path program 1 times [2024-11-10 15:05:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:41,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410734817] [2024-11-10 15:05:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410734817] [2024-11-10 15:05:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410734817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:41,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:05:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782642879] [2024-11-10 15:05:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:41,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:05:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:05:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:05:41,522 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:41,545 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-10 15:05:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:05:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11-10 15:05:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:41,546 INFO L225 Difference]: With dead ends: 57 [2024-11-10 15:05:41,547 INFO L226 Difference]: Without dead ends: 57 [2024-11-10 15:05:41,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-10 15:05:41,548 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:41,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 103 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-10 15:05:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2024-11-10 15:05:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-10 15:05:41,550 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 21 [2024-11-10 15:05:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:41,551 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-10 15:05:41,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-10 15:05:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:05:41,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:41,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:41,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:05:41,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 982699280, now seen corresponding path program 1 times [2024-11-10 15:05:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829716149] [2024-11-10 15:05:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829716149] [2024-11-10 15:05:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829716149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:05:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921807096] [2024-11-10 15:05:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:05:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:05:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:05:41,756 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:41,831 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2024-11-10 15:05:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:05:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-11-10 15:05:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:41,833 INFO L225 Difference]: With dead ends: 82 [2024-11-10 15:05:41,833 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 15:05:41,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:05:41,834 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:41,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 152 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 15:05:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2024-11-10 15:05:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-11-10 15:05:41,836 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 21 [2024-11-10 15:05:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:41,836 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-11-10 15:05:41,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-10 15:05:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:05:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:41,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:05:41,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash -14373073, now seen corresponding path program 1 times [2024-11-10 15:05:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614969761] [2024-11-10 15:05:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614969761] [2024-11-10 15:05:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614969761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6415380] [2024-11-10 15:05:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:42,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:42,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:05:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:42,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:05:42,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:42,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:05:42,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:42,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 15:05:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:42,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:42,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:42,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-10 15:05:42,781 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 12 treesize of output 10 [2024-11-10 15:05:42,785 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 20 treesize of output 16 [2024-11-10 15:05:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6415380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:42,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-10 15:05:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721179857] [2024-11-10 15:05:42,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:42,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:05:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:42,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:05:42,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:05:42,843 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 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-11-10 15:05:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:43,027 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-10 15:05:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:05:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 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) Word has length 21 [2024-11-10 15:05:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:43,029 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:05:43,029 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:05:43,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:05:43,029 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:43,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 325 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:05:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:05:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2024-11-10 15:05:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-10 15:05:43,032 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 21 [2024-11-10 15:05:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-10 15:05:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 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-11-10 15:05:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2024-11-10 15:05:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:05:43,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:43,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:43,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:05:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:43,238 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash 551507788, now seen corresponding path program 1 times [2024-11-10 15:05:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719984131] [2024-11-10 15:05:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:43,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719984131] [2024-11-10 15:05:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719984131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884928300] [2024-11-10 15:05:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:43,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:43,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:43,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:43,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:05:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:43,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:05:43,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:05:43,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:43,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:05:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:44,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:44,180 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 7 treesize of output 5 [2024-11-10 15:05:44,256 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 13 treesize of output 11 [2024-11-10 15:05:44,262 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 17 treesize of output 12 [2024-11-10 15:05:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884928300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:44,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2024-11-10 15:05:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627939294] [2024-11-10 15:05:44,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:05:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:05:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:05:44,308 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:44,726 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2024-11-10 15:05:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:05:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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 22 [2024-11-10 15:05:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:44,727 INFO L225 Difference]: With dead ends: 114 [2024-11-10 15:05:44,727 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 15:05:44,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 15:05:44,728 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:44,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 296 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:05:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 15:05:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2024-11-10 15:05:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2024-11-10 15:05:44,733 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 22 [2024-11-10 15:05:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2024-11-10 15:05:44,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2024-11-10 15:05:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:05:44,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:44,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:44,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:05:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:44,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -741501592, now seen corresponding path program 1 times [2024-11-10 15:05:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:44,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072650375] [2024-11-10 15:05:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072650375] [2024-11-10 15:05:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072650375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:05:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941354456] [2024-11-10 15:05:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:05:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:05:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:05:45,082 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-11-10 15:05:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:45,102 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2024-11-10 15:05:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:05:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-10 15:05:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:45,103 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:05:45,103 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 15:05:45,103 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-11-10 15:05:45,103 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 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-11-10 15:05:45,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 15:05:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-10 15:05:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 62 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-11-10 15:05:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-11-10 15:05:45,105 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 24 [2024-11-10 15:05:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-11-10 15:05:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2024-11-10 15:05:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:05:45,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:45,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:45,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:05:45,107 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-10 15:05:45,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1951675044, now seen corresponding path program 1 times [2024-11-10 15:05:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658590531] [2024-11-10 15:05:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:05:45,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:05:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:05:45,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 15:05:45,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:05:45,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-11-10 15:05:45,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-10 15:05:45,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-11-10 15:05:45,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-10 15:05:45,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-10 15:05:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-10 15:05:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-10 15:05:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-11-10 15:05:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-10 15:05:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-10 15:05:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:05:45,155 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:45,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:05:45,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:05:45 BoogieIcfgContainer [2024-11-10 15:05:45,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:05:45,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:05:45,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:05:45,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:05:45,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:05:35" (3/4) ... [2024-11-10 15:05:45,194 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 15:05:45,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:05:45,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:05:45,243 INFO L158 Benchmark]: Toolchain (without parser) took 10770.39ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 148.2MB in the beginning and 217.6MB in the end (delta: -69.4MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,243 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:05:45,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.30ms. Allocated memory is still 184.5MB. Free memory was 148.0MB in the beginning and 135.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.46ms. Allocated memory is still 184.5MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,244 INFO L158 Benchmark]: Boogie Preprocessor took 63.59ms. Allocated memory is still 184.5MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,244 INFO L158 Benchmark]: IcfgBuilder took 406.37ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 141.8MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,244 INFO L158 Benchmark]: TraceAbstraction took 9717.71ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 140.8MB in the beginning and 219.7MB in the end (delta: -79.0MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,245 INFO L158 Benchmark]: Witness Printer took 50.71ms. Allocated memory is still 323.0MB. Free memory was 219.7MB in the beginning and 217.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:05:45,246 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.30ms. Allocated memory is still 184.5MB. Free memory was 148.0MB in the beginning and 135.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.46ms. Allocated memory is still 184.5MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.59ms. Allocated memory is still 184.5MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 406.37ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 141.8MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9717.71ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 140.8MB in the beginning and 219.7MB in the end (delta: -79.0MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 50.71ms. Allocated memory is still 323.0MB. Free memory was 219.7MB in the beginning and 217.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L378] int length1 = __VERIFIER_nondet_int(); [L379] int length2 = __VERIFIER_nondet_int(); [L380] int n = __VERIFIER_nondet_int(); [L381] COND FALSE !(length1 < 1) VAL [length1=3, length2=2, n=0] [L384] COND FALSE !(length2 < 1) VAL [length1=3, length2=2, n=0] [L387] COND TRUE n < 1 [L388] n = 1 VAL [length1=3, length2=2, n=1] [L390] COND FALSE !(length1 < n || length1 - n < length2) [L391] char* nondetString1 = (char*) __builtin_alloca(length1 * sizeof(char)); [L392] char* nondetString2 = (char*) __builtin_alloca(length2 * sizeof(char)); VAL [length1=3, length2=2, n=1, nondetString1={4:0}, nondetString2={6:0}] [L393] nondetString1[0] = '\0' [L394] nondetString2[0] = '\0' [L395] nondetString1 += length1 - n - 1 [L396] nondetString2 += length2 - 1 [L397] CALL cstrncat(nondetString1, nondetString2, n) [L366] char *s = s1; VAL [n=1, s1={4:1}, s2={6:1}, s={4:1}] [L367] EXPR \read(*s) [L367] COND TRUE *s != '\0' [L368] s-- VAL [n=1, s1={4:1}, s2={6:1}, s={4:0}] [L367] EXPR \read(*s) [L367] COND FALSE !(*s != '\0') [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=1, s1={4:1}, s2={6:1}, s={4:0}] [L369] n != 0 && (*s = *s2--) != '\0' [L369] EXPR s2-- VAL [n=1, s1={4:1}, s2={6:0}, s={4:0}] [L369] EXPR s2-- [L369] EXPR *s = *s2-- [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=1, s1={4:1}, s2={6:0}, s={4:0}] [L369] COND TRUE n != 0 && (*s = *s2--) != '\0' [L370] n-- [L371] s-- VAL [n=0, s1={4:1}, s2={6:0}, s={4:-1}] [L369] n != 0 && (*s = *s2--) != '\0' VAL [n=0, s1={4:1}, s2={6:0}, s={4:-1}] [L369] n != 0 && (*s = *s2--) != '\0' [L369] COND FALSE !(n != 0 && (*s = *s2--) != '\0') [L373] \read(*s) - UnprovableResult [Line: 377]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 2909 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2230 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1801 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 679 mSDtfsCounter, 1801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=20, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 201 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 459 ConstructedInterpolants, 23 QuantifiedInterpolants, 3536 SizeOfPredicates, 31 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 10/59 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 15:05:45,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)