./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrlen_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/termination-15/cstrlen_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c025debcc565a2dee63ce0651143a120d30d92e148bf87ae3ffecb509f27f776 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:35:42,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:35:42,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:35:42,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:35:42,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:35:42,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:35:42,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:35:42,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:35:42,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:35:42,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:35:42,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:35:42,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:35:42,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:35:42,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:35:42,151 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:35:42,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:35:42,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:35:42,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:35:42,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:35:42,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:35:42,155 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:35:42,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:35:42,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:35:42,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:35:42,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:35:42,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:35:42,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:35:42,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:35:42,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:35:42,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:35:42,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:35:42,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:35:42,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:35:42,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:35:42,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c025debcc565a2dee63ce0651143a120d30d92e148bf87ae3ffecb509f27f776 [2024-10-13 10:35:42,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:35:42,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:35:42,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:35:42,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:35:42,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:35:42,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrlen_diffterm_alloca.i [2024-10-13 10:35:43,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:35:43,820 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:35:43,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrlen_diffterm_alloca.i [2024-10-13 10:35:43,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd992ceb/6eba3bb6a4474e5aac922611e9dd06cd/FLAGf4d91327b [2024-10-13 10:35:44,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd992ceb/6eba3bb6a4474e5aac922611e9dd06cd [2024-10-13 10:35:44,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:35:44,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:35:44,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:35:44,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:35:44,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:35:44,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bc1001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44, skipping insertion in model container [2024-10-13 10:35:44,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:35:44,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:35:44,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:35:44,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:35:44,544 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:35:44,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44 WrapperNode [2024-10-13 10:35:44,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:35:44,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:35:44,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:35:44,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:35:44,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,577 INFO L138 Inliner]: procedures = 152, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-10-13 10:35:44,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:35:44,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:35:44,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:35:44,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:35:44,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,596 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-10-13 10:35:44,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:35:44,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:35:44,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:35:44,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:35:44,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (1/1) ... [2024-10-13 10:35:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:35:44,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:44,630 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-13 10:35:44,632 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-13 10:35:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:35:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:35:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:35:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:35:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:35:44,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:35:44,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:35:44,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:35:44,830 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 10:35:44,830 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:35:44,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:35:44,854 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:35:44,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:44 BoogieIcfgContainer [2024-10-13 10:35:44,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:35:44,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:35:44,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:35:44,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:35:44,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:35:44" (1/3) ... [2024-10-13 10:35:44,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298c5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:35:44, skipping insertion in model container [2024-10-13 10:35:44,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:44" (2/3) ... [2024-10-13 10:35:44,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298c5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:35:44, skipping insertion in model container [2024-10-13 10:35:44,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:44" (3/3) ... [2024-10-13 10:35:44,863 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrlen_diffterm_alloca.i [2024-10-13 10:35:44,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:35:44,877 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-13 10:35:44,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:35:44,921 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;@1508d050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:35:44,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 10:35:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 2.0) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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-13 10:35:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:44,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:44,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:44,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2001092, now seen corresponding path program 1 times [2024-10-13 10:35:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429951949] [2024-10-13 10:35:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,154 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-13 10:35:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429951949] [2024-10-13 10:35:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429951949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760602527] [2024-10-13 10:35:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:35:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:35:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:35:45,209 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 2.0) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:45,260 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 10:35:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:35:45,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 10:35:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:45,267 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:45,269 INFO L226 Difference]: Without dead ends: 12 [2024-10-13 10:35:45,270 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-13 10:35:45,272 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:45,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-13 10:35:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 10:35:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.625) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-13 10:35:45,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 4 [2024-10-13 10:35:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:45,294 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 10:35:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-13 10:35:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:45,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:45,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:35:45,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2001093, now seen corresponding path program 1 times [2024-10-13 10:35:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487964536] [2024-10-13 10:35:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,520 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-13 10:35:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487964536] [2024-10-13 10:35:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487964536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:35:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657480946] [2024-10-13 10:35:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:35:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:35:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:35:45,525 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:45,543 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-13 10:35:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:35:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 10:35:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:45,545 INFO L225 Difference]: With dead ends: 14 [2024-10-13 10:35:45,545 INFO L226 Difference]: Without dead ends: 14 [2024-10-13 10:35:45,546 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-13 10:35:45,546 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:45,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-13 10:35:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 10:35:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-13 10:35:45,552 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2024-10-13 10:35:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:45,552 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-13 10:35:45,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-13 10:35:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:45,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:45,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:45,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:35:45,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:45,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2003015, now seen corresponding path program 1 times [2024-10-13 10:35:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416904104] [2024-10-13 10:35:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,687 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-13 10:35:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416904104] [2024-10-13 10:35:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416904104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:35:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804786952] [2024-10-13 10:35:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:35:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:35:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:35:45,689 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:45,706 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 10:35:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:35:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 10:35:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:45,707 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:45,707 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 10:35:45,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-13 10:35:45,708 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:45,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 10:35:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-10-13 10:35:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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-13 10:35:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-10-13 10:35:45,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 4 [2024-10-13 10:35:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-13 10:35:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-13 10:35:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-10-13 10:35:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:35:45,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:45,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:35:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:35:45,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 62034708, now seen corresponding path program 1 times [2024-10-13 10:35:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493784232] [2024-10-13 10:35:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,749 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-13 10:35:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493784232] [2024-10-13 10:35:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493784232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749307317] [2024-10-13 10:35:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:35:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:35:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:35:45,751 INFO L87 Difference]: Start difference. First operand 11 states and 12 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-13 10:35:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:45,768 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2024-10-13 10:35:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:35:45,769 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-13 10:35:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:45,769 INFO L225 Difference]: With dead ends: 10 [2024-10-13 10:35:45,769 INFO L226 Difference]: Without dead ends: 10 [2024-10-13 10:35:45,769 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-13 10:35:45,770 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:45,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-13 10:35:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 10:35:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-10-13 10:35:45,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2024-10-13 10:35:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:45,772 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-13 10:35:45,772 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-13 10:35:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-10-13 10:35:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:35:45,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:45,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:35:45,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:35:45,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:45,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 62034709, now seen corresponding path program 1 times [2024-10-13 10:35:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472819393] [2024-10-13 10:35:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,842 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-13 10:35:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472819393] [2024-10-13 10:35:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472819393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:35:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708480225] [2024-10-13 10:35:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:35:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:35:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:35:45,845 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-13 10:35:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:45,872 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2024-10-13 10:35:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:35:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-13 10:35:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:45,873 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:45,874 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 10:35:45,874 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-13 10:35:45,875 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 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-13 10:35:45,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 10:35:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-10-13 10:35:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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-13 10:35:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-10-13 10:35:45,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2024-10-13 10:35:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:45,881 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-13 10:35:45,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-13 10:35:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-10-13 10:35:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:35:45,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:45,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:45,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:35:45,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash -514187922, now seen corresponding path program 1 times [2024-10-13 10:35:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151539025] [2024-10-13 10:35:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:45,986 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-13 10:35:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151539025] [2024-10-13 10:35:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151539025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:45,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:45,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:35:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728505670] [2024-10-13 10:35:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:45,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:35:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:45,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:35:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:35:45,990 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:46,027 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-10-13 10:35:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:35:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 10:35:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:46,028 INFO L225 Difference]: With dead ends: 16 [2024-10-13 10:35:46,028 INFO L226 Difference]: Without dead ends: 16 [2024-10-13 10:35:46,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:35:46,029 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:46,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-13 10:35:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-10-13 10:35:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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-13 10:35:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-13 10:35:46,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2024-10-13 10:35:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:46,031 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-13 10:35:46,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-13 10:35:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:35:46,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:46,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:46,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:35:46,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:46,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash -456929620, now seen corresponding path program 1 times [2024-10-13 10:35:46,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:46,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524511263] [2024-10-13 10:35:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:46,154 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-13 10:35:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524511263] [2024-10-13 10:35:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524511263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:35:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339013874] [2024-10-13 10:35:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:46,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:46,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:46,156 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-13 10:35:46,158 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-13 10:35:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:46,199 WARN L253 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 10:35:46,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:35:46,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:35:46,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:35:46,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-13 10:35:46,381 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-13 10:35:46,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:35:46,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-13 10:35:46,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-13 10:35:46,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-13 10:35:46,491 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-13 10:35:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339013874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:35:46,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:35:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-10-13 10:35:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612083098] [2024-10-13 10:35:46,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:35:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:35:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:35:46,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:35:46,493 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 10:35:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:46,557 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-10-13 10:35:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:35:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 10:35:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:46,559 INFO L225 Difference]: With dead ends: 20 [2024-10-13 10:35:46,559 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 10:35:46,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:35:46,559 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:46,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 10:35:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-10-13 10:35:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-13 10:35:46,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2024-10-13 10:35:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:46,562 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-13 10:35:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 10:35:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-13 10:35:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:35:46,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:46,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:46,578 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-13 10:35:46,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:46,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1240042302, now seen corresponding path program 1 times [2024-10-13 10:35:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729917705] [2024-10-13 10:35:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:46,835 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-13 10:35:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729917705] [2024-10-13 10:35:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729917705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:46,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730841736] [2024-10-13 10:35:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:46,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:35:46,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:46,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:35:46,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:35:46,837 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:46,844 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-13 10:35:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:35:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:35:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:46,845 INFO L225 Difference]: With dead ends: 16 [2024-10-13 10:35:46,845 INFO L226 Difference]: Without dead ends: 10 [2024-10-13 10:35:46,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:35:46,846 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:46,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-13 10:35:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 10:35:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-13 10:35:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-10-13 10:35:46,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2024-10-13 10:35:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:46,848 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-10-13 10:35:46,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-10-13 10:35:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:35:46,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:46,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-13 10:35:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:35:46,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1022701755, now seen corresponding path program 2 times [2024-10-13 10:35:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192616585] [2024-10-13 10:35:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:46,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:35:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192616585] [2024-10-13 10:35:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192616585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:35:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235237003] [2024-10-13 10:35:47,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:35:47,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:47,151 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-13 10:35:47,152 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-13 10:35:47,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:35:47,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:35:47,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 10:35:47,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:35:47,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 10:35:47,735 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2024-10-13 10:35:47,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2024-10-13 10:35:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:35:47,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:35:47,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-13 10:35:47,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-10-13 10:35:47,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:35:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:35:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235237003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:35:47,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:35:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-13 10:35:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223053590] [2024-10-13 10:35:47,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:35:47,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:35:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:35:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2024-10-13 10:35:47,986 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 10:35:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:48,268 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2024-10-13 10:35:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:35:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:35:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:48,269 INFO L225 Difference]: With dead ends: 10 [2024-10-13 10:35:48,269 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:35:48,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=440, Unknown=1, NotChecked=0, Total=552 [2024-10-13 10:35:48,270 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:48,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:35:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:35:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:35:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-13 10:35:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:35:48,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2024-10-13 10:35:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:48,271 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:35:48,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 10:35:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:35:48,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:35:48,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2024-10-13 10:35:48,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2024-10-13 10:35:48,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2024-10-13 10:35:48,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2024-10-13 10:35:48,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-13 10:35:48,287 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-13 10:35:48,478 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-13 10:35:48,481 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:48,483 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:35:48,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:35:48 BoogieIcfgContainer [2024-10-13 10:35:48,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:35:48,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:35:48,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:35:48,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:35:48,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:44" (3/4) ... [2024-10-13 10:35:48,487 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:35:48,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 10:35:48,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:35:48,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:35:48,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:35:48,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:35:48,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:35:48,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:35:48,556 INFO L158 Benchmark]: Toolchain (without parser) took 4345.44ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 62.4MB in the beginning and 193.6MB in the end (delta: -131.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:35:48,556 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:35:48,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.94ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 62.2MB in the beginning and 153.1MB in the end (delta: -90.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-13 10:35:48,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 195.0MB. Free memory was 153.1MB in the beginning and 150.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:35:48,557 INFO L158 Benchmark]: Boogie Preprocessor took 25.12ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 148.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:35:48,557 INFO L158 Benchmark]: RCFGBuilder took 250.80ms. Allocated memory is still 195.0MB. Free memory was 148.9MB in the beginning and 135.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:35:48,557 INFO L158 Benchmark]: TraceAbstraction took 3628.17ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 134.2MB in the beginning and 198.5MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:35:48,557 INFO L158 Benchmark]: Witness Printer took 70.32ms. Allocated memory is still 234.9MB. Free memory was 197.4MB in the beginning and 193.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:35:48,559 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.13ms. Allocated memory is still 134.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.94ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 62.2MB in the beginning and 153.1MB in the end (delta: -90.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 195.0MB. Free memory was 153.1MB in the beginning and 150.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.12ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 148.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 250.80ms. Allocated memory is still 195.0MB. Free memory was 148.9MB in the beginning and 135.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3628.17ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 134.2MB in the beginning and 198.5MB in the end (delta: -64.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.32ms. Allocated memory is still 234.9MB. Free memory was 197.4MB in the beginning and 193.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 371]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 50 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 72 ConstructedInterpolants, 4 QuantifiedInterpolants, 718 SizeOfPredicates, 12 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1/16 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:35:48,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE