./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:03:54,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:03:54,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:03:54,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:03:54,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:03:54,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:03:54,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:03:54,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:03:54,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:03:54,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:03:54,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:03:54,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:03:54,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:03:54,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:03:54,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:03:54,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:03:54,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:03:54,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:03:54,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:03:54,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:03:54,334 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:03:54,335 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:03:54,335 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:03:54,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:03:54,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:03:54,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:03:54,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:03:54,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:03:54,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:03:54,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:03:54,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:03:54,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:03:54,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:03:54,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:03:54,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:03:54,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:03:54,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:03:54,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:03:54,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:03:54,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:03:54,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:03:54,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:03:54,343 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 [2024-10-24 16:03:54,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:03:54,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:03:54,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:03:54,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:03:54,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:03:54,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2024-10-24 16:03:56,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:03:56,402 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:03:56,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2024-10-24 16:03:56,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3585c500a/8b8395f2266d40e29365a7db8ba7e4eb/FLAG13355d6f0 [2024-10-24 16:03:56,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3585c500a/8b8395f2266d40e29365a7db8ba7e4eb [2024-10-24 16:03:56,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:03:56,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:03:56,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:03:56,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:03:56,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:03:56,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb38728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56, skipping insertion in model container [2024-10-24 16:03:56,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:03:56,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:03:56,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:03:56,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:03:56,891 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:03:56,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56 WrapperNode [2024-10-24 16:03:56,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:03:56,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:03:56,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:03:56,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:03:56,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,941 INFO L138 Inliner]: procedures = 118, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-10-24 16:03:56,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:03:56,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:03:56,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:03:56,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:03:56,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,973 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-24 16:03:56,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:03:56,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:03:56,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:03:56,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:03:56,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (1/1) ... [2024-10-24 16:03:56,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:03:57,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:03:57,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:03:57,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:03:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:03:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:03:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:03:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:03:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:03:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:03:57,203 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:03:57,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:03:57,412 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-24 16:03:57,412 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:03:57,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:03:57,479 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 16:03:57,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:57 BoogieIcfgContainer [2024-10-24 16:03:57,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:03:57,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:03:57,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:03:57,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:03:57,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:03:56" (1/3) ... [2024-10-24 16:03:57,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa080a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:57, skipping insertion in model container [2024-10-24 16:03:57,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:56" (2/3) ... [2024-10-24 16:03:57,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa080a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:57, skipping insertion in model container [2024-10-24 16:03:57,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:57" (3/3) ... [2024-10-24 16:03:57,489 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe.i [2024-10-24 16:03:57,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:03:57,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 16:03:57,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:03:57,562 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;@34d1bd09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:03:57,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 16:03:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:03:57,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:57,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:03:57,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash 105439544, now seen corresponding path program 1 times [2024-10-24 16:03:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:57,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383618638] [2024-10-24 16:03:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:57,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383618638] [2024-10-24 16:03:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383618638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:03:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015622705] [2024-10-24 16:03:57,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:03:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:57,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:03:57,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:03:57,888 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:57,958 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-24 16:03:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:03:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:03:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:57,969 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:03:57,969 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 16:03:57,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:03:57,974 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:57,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:03:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 16:03:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-24 16:03:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 19 states have (on average 2.0) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-24 16:03:58,010 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 5 [2024-10-24 16:03:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:58,011 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-24 16:03:58,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-24 16:03:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:03:58,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:58,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:03:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:03:58,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 105499126, now seen corresponding path program 1 times [2024-10-24 16:03:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:58,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992324573] [2024-10-24 16:03:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992324573] [2024-10-24 16:03:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992324573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:58,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:03:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846296431] [2024-10-24 16:03:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:03:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:58,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:03:58,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:03:58,117 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:58,157 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-10-24 16:03:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:03:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:03:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:58,158 INFO L225 Difference]: With dead ends: 33 [2024-10-24 16:03:58,158 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 16:03:58,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:03:58,160 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:58,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:03:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 16:03:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 16:03:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.894736842105263) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-10-24 16:03:58,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 5 [2024-10-24 16:03:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:58,173 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-10-24 16:03:58,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-10-24 16:03:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:03:58,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:58,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:03:58,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:03:58,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash 105499127, now seen corresponding path program 1 times [2024-10-24 16:03:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884807426] [2024-10-24 16:03:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884807426] [2024-10-24 16:03:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884807426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:58,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:58,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:03:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519293343] [2024-10-24 16:03:58,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:58,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:03:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:03:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:03:58,402 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:58,475 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-24 16:03:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:03:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:03:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:58,476 INFO L225 Difference]: With dead ends: 35 [2024-10-24 16:03:58,476 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 16:03:58,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:03:58,478 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:58,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:03:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 16:03:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 16:03:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-24 16:03:58,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-24 16:03:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-24 16:03:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-24 16:03:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:03:58,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:58,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:03:58,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:03:58,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1026343076, now seen corresponding path program 1 times [2024-10-24 16:03:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881392587] [2024-10-24 16:03:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881392587] [2024-10-24 16:03:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881392587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:03:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975924860] [2024-10-24 16:03:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:03:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:03:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:03:58,633 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:58,678 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-24 16:03:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:03:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:03:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:58,680 INFO L225 Difference]: With dead ends: 37 [2024-10-24 16:03:58,680 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:03:58,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:03:58,681 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:58,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:03:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:03:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 16:03:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-24 16:03:58,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2024-10-24 16:03:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:58,690 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-24 16:03:58,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-24 16:03:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:03:58,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:58,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:03:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:03:58,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:58,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1024496034, now seen corresponding path program 1 times [2024-10-24 16:03:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514383072] [2024-10-24 16:03:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514383072] [2024-10-24 16:03:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514383072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:03:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801451561] [2024-10-24 16:03:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:03:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:03:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:03:58,903 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:58,960 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-24 16:03:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:03:58,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:03:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:58,963 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:03:58,963 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:03:58,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:03:58,965 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:58,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:03:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:03:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-24 16:03:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-24 16:03:58,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2024-10-24 16:03:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:58,976 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-24 16:03:58,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-24 16:03:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:03:58,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:58,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:03:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:03:58,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1751862385, now seen corresponding path program 1 times [2024-10-24 16:03:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081652394] [2024-10-24 16:03:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:59,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081652394] [2024-10-24 16:03:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081652394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:59,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:03:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006388943] [2024-10-24 16:03:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:59,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:03:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:03:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:03:59,058 INFO L87 Difference]: Start difference. First operand 37 states and 41 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-10-24 16:03:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:59,097 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-10-24 16:03:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:03:59,098 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-10-24 16:03:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:59,098 INFO L225 Difference]: With dead ends: 34 [2024-10-24 16:03:59,099 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 16:03:59,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:03:59,100 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:59,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:03:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 16:03:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-24 16:03:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-24 16:03:59,105 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2024-10-24 16:03:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:59,106 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-24 16:03:59,106 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-10-24 16:03:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-24 16:03:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:03:59,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:59,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:03:59,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:03:59,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:59,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1751862384, now seen corresponding path program 1 times [2024-10-24 16:03:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786110453] [2024-10-24 16:03:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786110453] [2024-10-24 16:03:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786110453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:03:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:03:59,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:03:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557847352] [2024-10-24 16:03:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:03:59,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:03:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:03:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:03:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:03:59,278 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:03:59,334 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-24 16:03:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:03:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:03:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:03:59,335 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:03:59,335 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:03:59,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:03:59,337 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:03:59,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:03:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:03:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 16:03:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-24 16:03:59,348 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 7 [2024-10-24 16:03:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:03:59,348 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-24 16:03:59,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:03:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-24 16:03:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:03:59,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:03:59,350 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 16:03:59,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:03:59,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:03:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:03:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1694487201, now seen corresponding path program 1 times [2024-10-24 16:03:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:03:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012862554] [2024-10-24 16:03:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:03:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:03:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012862554] [2024-10-24 16:03:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012862554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:03:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433291533] [2024-10-24 16:03:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:03:59,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:03:59,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:03:59,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:03:59,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:03:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:03:59,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:03:59,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:03:59,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-24 16:03:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:03:59,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:04:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:04:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433291533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:04:00,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:04:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-24 16:04:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075766869] [2024-10-24 16:04:00,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:04:00,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:04:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:04:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:04:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:04:00,032 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-10-24 16:04:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:04:00,244 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-24 16:04:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:04:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 7 [2024-10-24 16:04:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:04:00,247 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:04:00,247 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:04:00,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:04:00,249 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:04:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:04:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:04:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-24 16:04:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 36 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-10-24 16:04:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-24 16:04:00,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 7 [2024-10-24 16:04:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:04:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-24 16:04:00,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-10-24 16:04:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-24 16:04:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:04:00,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:04:00,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:04:00,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:04:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:04:00,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:04:00,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:04:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash -989497354, now seen corresponding path program 1 times [2024-10-24 16:04:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:04:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807906587] [2024-10-24 16:04:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:04:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:04:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:04:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:04:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:04:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807906587] [2024-10-24 16:04:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807906587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:04:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512999941] [2024-10-24 16:04:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:04:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:04:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:04:00,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:04:00,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:04:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:04:00,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:04:00,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:04:00,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-24 16:04:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:04:00,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:04:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:04:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512999941] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 16:04:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:04:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 11 [2024-10-24 16:04:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206980459] [2024-10-24 16:04:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:04:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:04:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:04:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:04:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:04:00,929 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:04:01,003 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-24 16:04:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:04:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 16:04:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:04:01,005 INFO L225 Difference]: With dead ends: 36 [2024-10-24 16:04:01,005 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 16:04:01,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:04:01,006 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:04:01,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:04:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 16:04:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-24 16:04:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-24 16:04:01,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 8 [2024-10-24 16:04:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:04:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-24 16:04:01,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-24 16:04:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:04:01,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:04:01,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:04:01,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:04:01,220 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,SelfDestructingSolverStorable8 [2024-10-24 16:04:01,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:04:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:04:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1583426582, now seen corresponding path program 1 times [2024-10-24 16:04:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:04:01,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461274111] [2024-10-24 16:04:01,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:04:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:04:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:04:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:04:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:04:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461274111] [2024-10-24 16:04:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461274111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:04:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:04:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:04:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777514585] [2024-10-24 16:04:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:04:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:04:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:04:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:04:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:04:01,245 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:04:01,261 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-24 16:04:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:04:01,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:04:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:04:01,263 INFO L225 Difference]: With dead ends: 35 [2024-10-24 16:04:01,264 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 16:04:01,264 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-10-24 16:04:01,264 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:04:01,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:04:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 16:04:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 16:04:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-24 16:04:01,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2024-10-24 16:04:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:04:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-24 16:04:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:04:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-24 16:04:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:04:01,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:04:01,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:04:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:04:01,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2024-10-24 16:04:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:04:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1841584153, now seen corresponding path program 1 times [2024-10-24 16:04:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:04:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592977756] [2024-10-24 16:04:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:04:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:04:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:04:01,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:04:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:04:01,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 16:04:01,319 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:04:01,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2024-10-24 16:04:01,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2024-10-24 16:04:01,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2024-10-24 16:04:01,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2024-10-24 16:04:01,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2024-10-24 16:04:01,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2024-10-24 16:04:01,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2024-10-24 16:04:01,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2024-10-24 16:04:01,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2024-10-24 16:04:01,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 16 remaining) [2024-10-24 16:04:01,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2024-10-24 16:04:01,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:04:01,328 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:04:01,348 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:04:01,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:04:01 BoogieIcfgContainer [2024-10-24 16:04:01,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:04:01,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:04:01,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:04:01,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:04:01,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:57" (3/4) ... [2024-10-24 16:04:01,355 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 16:04:01,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:04:01,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:04:01,390 INFO L158 Benchmark]: Toolchain (without parser) took 4957.10ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 100.4MB in the beginning and 72.1MB in the end (delta: 28.3MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,391 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:04:01,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.05ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,392 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,392 INFO L158 Benchmark]: RCFGBuilder took 489.87ms. Allocated memory is still 155.2MB. Free memory was 78.0MB in the beginning and 59.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,392 INFO L158 Benchmark]: TraceAbstraction took 3870.37ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 59.1MB in the beginning and 74.2MB in the end (delta: -15.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,392 INFO L158 Benchmark]: Witness Printer took 36.49ms. Allocated memory is still 190.8MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:04:01,394 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.17ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.05ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.87ms. Allocated memory is still 155.2MB. Free memory was 78.0MB in the beginning and 59.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3870.37ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 59.1MB in the beginning and 74.2MB in the end (delta: -15.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 36.49ms. Allocated memory is still 190.8MB. Free memory was 74.2MB in the beginning and 72.1MB 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: [L536] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [length=1, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' [L527] return nondetString; [L536] RET, EXPR build_nondet_String() [L536] char* s = build_nondet_String(); [L537] CALL cstrchr(s,__VERIFIER_nondet_int()) [L531] EXPR \read(*s) [L531] *s != '\0' && *s != (char)c VAL [c=2, s={-1:0}] [L531] *s != '\0' && *s != (char)c [L531] COND FALSE !(*s != '\0' && *s != (char)c) [L533] EXPR \read(*s) [L533] return ( (*s == c) ? (char *) s : 0 ); [L537] RET cstrchr(s,__VERIFIER_nondet_int()) - 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: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 214 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=7, InterpolantAutomatonStates: 45, 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, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 909 SizeOfPredicates, 2 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 3/10 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-10-24 16:04:01,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)