./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-12 13:17:36,847 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-12 13:17:36,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-12 13:17:36,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-12 13:17:36,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-12 13:17:36,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-12 13:17:36,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-12 13:17:36,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-12 13:17:36,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-12 13:17:36,944 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-12 13:17:36,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-12 13:17:36,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-12 13:17:36,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-12 13:17:36,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-12 13:17:36,946 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-12 13:17:36,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-12 13:17:36,946 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-12 13:17:36,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-12 13:17:36,947 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-12 13:17:36,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-12 13:17:36,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-12 13:17:36,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-12 13:17:36,954 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-12 13:17:36,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-12 13:17:36,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-12 13:17:36,955 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-12 13:17:36,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-12 13:17:36,955 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-12 13:17:36,956 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-12 13:17:36,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-12 13:17:36,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-12 13:17:36,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-12 13:17:36,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-12 13:17:36,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 13:17:36,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-12 13:17:36,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-12 13:17:36,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-12 13:17:36,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-12 13:17:36,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-12 13:17:36,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-12 13:17:36,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-12 13:17:36,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-12 13:17:36,959 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a
[2024-11-12 13:17:37,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-12 13:17:37,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-12 13:17:37,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-12 13:17:37,247 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-12 13:17:37,247 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-12 13:17:37,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c
[2024-11-12 13:17:38,727 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-12 13:17:38,934 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-12 13:17:38,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c
[2024-11-12 13:17:38,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21a12cd6/4c8da54adda74d3a829bb49c73571d53/FLAGa281fab58
[2024-11-12 13:17:39,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21a12cd6/4c8da54adda74d3a829bb49c73571d53
[2024-11-12 13:17:39,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-12 13:17:39,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-12 13:17:39,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-12 13:17:39,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-12 13:17:39,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-12 13:17:39,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7eda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39, skipping insertion in model container
[2024-11-12 13:17:39,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,344 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-12 13:17:39,570 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-12 13:17:39,580 INFO L200 MainTranslator]: Completed pre-run
[2024-11-12 13:17:39,598 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-12 13:17:39,617 INFO L204 MainTranslator]: Completed translation
[2024-11-12 13:17:39,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39 WrapperNode
[2024-11-12 13:17:39,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-12 13:17:39,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-12 13:17:39,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-12 13:17:39,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-12 13:17:39,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,657 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94
[2024-11-12 13:17:39,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-12 13:17:39,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-12 13:17:39,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-12 13:17:39,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-12 13:17:39,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,685 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1].
[2024-11-12 13:17:39,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-12 13:17:39,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-12 13:17:39,700 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-12 13:17:39,701 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-12 13:17:39,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (1/1) ...
[2024-11-12 13:17:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 13:17:39,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:39,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-12 13:17:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-12 13:17:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-12 13:17:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-12 13:17:39,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-12 13:17:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-12 13:17:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-12 13:17:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-12 13:17:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-12 13:17:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-12 13:17:39,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-12 13:17:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-12 13:17:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-12 13:17:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-12 13:17:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-12 13:17:39,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-12 13:17:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-12 13:17:39,869 INFO L238 CfgBuilder]: Building ICFG
[2024-11-12 13:17:39,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-12 13:17:40,116 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live.
[2024-11-12 13:17:40,116 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-12 13:17:40,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-12 13:17:40,134 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-12 13:17:40,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:40 BoogieIcfgContainer
[2024-11-12 13:17:40,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-12 13:17:40,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-12 13:17:40,137 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-12 13:17:40,141 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-12 13:17:40,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:17:39" (1/3) ...
[2024-11-12 13:17:40,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a35b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:17:40, skipping insertion in model container
[2024-11-12 13:17:40,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:17:39" (2/3) ...
[2024-11-12 13:17:40,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a35b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:17:40, skipping insertion in model container
[2024-11-12 13:17:40,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:40" (3/3) ...
[2024-11-12 13:17:40,145 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c
[2024-11-12 13:17:40,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-12 13:17:40,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations.
[2024-11-12 13:17:40,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-12 13:17:40,217 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;@2420cf95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-12 13:17:40,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2024-11-12 13:17:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 1.696969696969697) internal successors, (56), 51 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-12 13:17:40,227 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:40,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:40,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:40,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -771427124, now seen corresponding path program 1 times
[2024-11-12 13:17:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564699700]
[2024-11-12 13:17:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:40,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564699700]
[2024-11-12 13:17:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564699700] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:40,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:40,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-12 13:17:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41987293]
[2024-11-12 13:17:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-12 13:17:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-12 13:17:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-12 13:17:40,490 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.696969696969697) internal successors, (56), 51 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:40,505 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions.
[2024-11-12 13:17:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-12 13:17:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2024-11-12 13:17:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:40,513 INFO L225 Difference]: With dead ends: 57
[2024-11-12 13:17:40,513 INFO L226 Difference]: Without dead ends: 55
[2024-11-12 13:17:40,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-12 13:17:40,517 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:40,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-12 13:17:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2024-11-12 13:17:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2024-11-12 13:17:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 48 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions.
[2024-11-12 13:17:40,562 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18
[2024-11-12 13:17:40,563 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:40,563 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions.
[2024-11-12 13:17:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions.
[2024-11-12 13:17:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-12 13:17:40,566 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:40,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:40,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-12 13:17:40,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:40,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -7537012, now seen corresponding path program 1 times
[2024-11-12 13:17:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185942977]
[2024-11-12 13:17:40,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185942977]
[2024-11-12 13:17:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185942977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-12 13:17:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676699139]
[2024-11-12 13:17:40,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-12 13:17:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-12 13:17:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-12 13:17:40,919 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:41,065 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions.
[2024-11-12 13:17:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-12 13:17:41,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2024-11-12 13:17:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:41,067 INFO L225 Difference]: With dead ends: 52
[2024-11-12 13:17:41,067 INFO L226 Difference]: Without dead ends: 52
[2024-11-12 13:17:41,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-12 13:17:41,068 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:41,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-12 13:17:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-11-12 13:17:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2024-11-12 13:17:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 45 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions.
[2024-11-12 13:17:41,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 18
[2024-11-12 13:17:41,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:41,085 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions.
[2024-11-12 13:17:41,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions.
[2024-11-12 13:17:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-12 13:17:41,087 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:41,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:41,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-12 13:17:41,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:41,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash -7537011, now seen corresponding path program 1 times
[2024-11-12 13:17:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:41,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874855364]
[2024-11-12 13:17:41,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874855364]
[2024-11-12 13:17:41,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874855364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-12 13:17:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032033619]
[2024-11-12 13:17:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:41,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-12 13:17:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-12 13:17:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-11-12 13:17:41,770 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:42,124 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions.
[2024-11-12 13:17:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-12 13:17:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2024-11-12 13:17:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:42,127 INFO L225 Difference]: With dead ends: 61
[2024-11-12 13:17:42,127 INFO L226 Difference]: Without dead ends: 61
[2024-11-12 13:17:42,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182
[2024-11-12 13:17:42,129 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:42,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 232 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-12 13:17:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2024-11-12 13:17:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55.
[2024-11-12 13:17:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.5) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions.
[2024-11-12 13:17:42,138 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 18
[2024-11-12 13:17:42,138 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:42,139 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions.
[2024-11-12 13:17:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions.
[2024-11-12 13:17:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-12 13:17:42,140 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:42,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:42,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-12 13:17:42,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:42,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash -233647381, now seen corresponding path program 1 times
[2024-11-12 13:17:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756283719]
[2024-11-12 13:17:42,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756283719]
[2024-11-12 13:17:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756283719] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-12 13:17:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069969507]
[2024-11-12 13:17:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:42,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-12 13:17:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-12 13:17:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-11-12 13:17:42,690 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:43,031 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions.
[2024-11-12 13:17:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-12 13:17:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19
[2024-11-12 13:17:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:43,032 INFO L225 Difference]: With dead ends: 61
[2024-11-12 13:17:43,033 INFO L226 Difference]: Without dead ends: 61
[2024-11-12 13:17:43,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240
[2024-11-12 13:17:43,034 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:43,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 288 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-12 13:17:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2024-11-12 13:17:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56.
[2024-11-12 13:17:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions.
[2024-11-12 13:17:43,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 19
[2024-11-12 13:17:43,049 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions.
[2024-11-12 13:17:43,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-12 13:17:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions.
[2024-11-12 13:17:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-12 13:17:43,050 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:43,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:43,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-12 13:17:43,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:43,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1188113120, now seen corresponding path program 1 times
[2024-11-12 13:17:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986538863]
[2024-11-12 13:17:43,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986538863]
[2024-11-12 13:17:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986538863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:43,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:43,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-12 13:17:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273696226]
[2024-11-12 13:17:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:43,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 13:17:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 13:17:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 13:17:43,108 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-12 13:17:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:43,121 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions.
[2024-11-12 13:17:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-12 13:17:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21
[2024-11-12 13:17:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:43,123 INFO L225 Difference]: With dead ends: 57
[2024-11-12 13:17:43,124 INFO L226 Difference]: Without dead ends: 57
[2024-11-12 13:17:43,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 13:17:43,125 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:43,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-12 13:17:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-12 13:17:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-12 13:17:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions.
[2024-11-12 13:17:43,132 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 21
[2024-11-12 13:17:43,132 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:43,132 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions.
[2024-11-12 13:17:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-12 13:17:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions.
[2024-11-12 13:17:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-12 13:17:43,133 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:43,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:43,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-12 13:17:43,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:43,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1909194143, now seen corresponding path program 1 times
[2024-11-12 13:17:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:43,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473113701]
[2024-11-12 13:17:43,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-12 13:17:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473113701]
[2024-11-12 13:17:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473113701] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686329075]
[2024-11-12 13:17:43,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:43,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:43,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:43,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-12 13:17:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:43,633 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:43,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2024-11-12 13:17:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 13:17:44,287 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-12 13:17:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686329075] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:17:44,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:17:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 28
[2024-11-12 13:17:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333051815]
[2024-11-12 13:17:44,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:44,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-11-12 13:17:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-11-12 13:17:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812
[2024-11-12 13:17:44,747 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-12 13:17:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:45,493 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions.
[2024-11-12 13:17:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-12 13:17:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24
[2024-11-12 13:17:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:45,496 INFO L225 Difference]: With dead ends: 62
[2024-11-12 13:17:45,497 INFO L226 Difference]: Without dead ends: 62
[2024-11-12 13:17:45,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482
[2024-11-12 13:17:45,498 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 150 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:45,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 436 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-12 13:17:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2024-11-12 13:17:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56.
[2024-11-12 13:17:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions.
[2024-11-12 13:17:45,506 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24
[2024-11-12 13:17:45,506 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:45,507 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions.
[2024-11-12 13:17:45,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-12 13:17:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions.
[2024-11-12 13:17:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-12 13:17:45,508 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:45,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:45,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-12 13:17:45,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-11-12 13:17:45,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:45,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -944523751, now seen corresponding path program 1 times
[2024-11-12 13:17:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822211896]
[2024-11-12 13:17:45,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-12 13:17:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822211896]
[2024-11-12 13:17:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822211896] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132846200]
[2024-11-12 13:17:46,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:46,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:46,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:46,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:46,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-12 13:17:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:46,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:46,244 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:46,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2024-11-12 13:17:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 13:17:46,991 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132846200] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:47,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-12 13:17:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24
[2024-11-12 13:17:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173275161]
[2024-11-12 13:17:47,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-11-12 13:17:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-12 13:17:47,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056
[2024-11-12 13:17:47,703 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-12 13:17:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:48,899 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions.
[2024-11-12 13:17:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-12 13:17:48,900 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25
[2024-11-12 13:17:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:48,902 INFO L225 Difference]: With dead ends: 61
[2024-11-12 13:17:48,902 INFO L226 Difference]: Without dead ends: 61
[2024-11-12 13:17:48,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=331, Invalid=1649, Unknown=0, NotChecked=0, Total=1980
[2024-11-12 13:17:48,904 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:48,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 436 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-12 13:17:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2024-11-12 13:17:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51.
[2024-11-12 13:17:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.4375) internal successors, (46), 44 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions.
[2024-11-12 13:17:48,912 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25
[2024-11-12 13:17:48,912 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:48,912 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions.
[2024-11-12 13:17:48,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-12 13:17:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions.
[2024-11-12 13:17:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-12 13:17:48,913 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:48,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:48,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-12 13:17:49,119 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,SelfDestructingSolverStorable6
[2024-11-12 13:17:49,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 601475362, now seen corresponding path program 1 times
[2024-11-12 13:17:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685001633]
[2024-11-12 13:17:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-12 13:17:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:17:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685001633]
[2024-11-12 13:17:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685001633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-12 13:17:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263089650]
[2024-11-12 13:17:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-12 13:17:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-12 13:17:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-12 13:17:49,201 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-12 13:17:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:49,269 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions.
[2024-11-12 13:17:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-12 13:17:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26
[2024-11-12 13:17:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:49,271 INFO L225 Difference]: With dead ends: 48
[2024-11-12 13:17:49,271 INFO L226 Difference]: Without dead ends: 48
[2024-11-12 13:17:49,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-12 13:17:49,272 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 87 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-12 13:17:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-11-12 13:17:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47.
[2024-11-12 13:17:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.3125) internal successors, (42), 40 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions.
[2024-11-12 13:17:49,275 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26
[2024-11-12 13:17:49,275 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions.
[2024-11-12 13:17:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-12 13:17:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions.
[2024-11-12 13:17:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-12 13:17:49,276 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:49,276 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:49,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-12 13:17:49,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:49,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 601475363, now seen corresponding path program 1 times
[2024-11-12 13:17:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951170721]
[2024-11-12 13:17:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-12 13:17:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-12 13:17:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951170721]
[2024-11-12 13:17:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951170721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:49,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-12 13:17:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935964246]
[2024-11-12 13:17:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-12 13:17:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-12 13:17:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-12 13:17:49,391 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-12 13:17:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:49,445 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions.
[2024-11-12 13:17:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-12 13:17:49,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26
[2024-11-12 13:17:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:49,448 INFO L225 Difference]: With dead ends: 57
[2024-11-12 13:17:49,448 INFO L226 Difference]: Without dead ends: 53
[2024-11-12 13:17:49,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-12 13:17:49,449 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:49,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 228 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-12 13:17:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2024-11-12 13:17:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2024-11-12 13:17:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.263157894736842) internal successors, (48), 46 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-12 13:17:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions.
[2024-11-12 13:17:49,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 26
[2024-11-12 13:17:49,455 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:49,455 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions.
[2024-11-12 13:17:49,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-12 13:17:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions.
[2024-11-12 13:17:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-12 13:17:49,456 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:49,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-12 13:17:49,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash 259626549, now seen corresponding path program 1 times
[2024-11-12 13:17:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349428645]
[2024-11-12 13:17:49,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:17:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-12 13:17:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349428645]
[2024-11-12 13:17:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349428645] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553298988]
[2024-11-12 13:17:49,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:49,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-12 13:17:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:49,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 46 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:49,923 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:50,242 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:50,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-12 13:17:50,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48
[2024-11-12 13:17:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-12 13:17:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553298988] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:17:50,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:17:50,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 28
[2024-11-12 13:17:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387969161]
[2024-11-12 13:17:50,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:50,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-11-12 13:17:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-11-12 13:17:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812
[2024-11-12 13:17:50,720 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-12 13:17:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:51,509 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions.
[2024-11-12 13:17:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-12 13:17:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32
[2024-11-12 13:17:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:51,512 INFO L225 Difference]: With dead ends: 89
[2024-11-12 13:17:51,512 INFO L226 Difference]: Without dead ends: 89
[2024-11-12 13:17:51,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640
[2024-11-12 13:17:51,514 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 127 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:51,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 443 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-12 13:17:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2024-11-12 13:17:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73.
[2024-11-12 13:17:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 64 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 13:17:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions.
[2024-11-12 13:17:51,527 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 32
[2024-11-12 13:17:51,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:51,527 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions.
[2024-11-12 13:17:51,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-12 13:17:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions.
[2024-11-12 13:17:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2024-11-12 13:17:51,528 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:51,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:51,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-12 13:17:51,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:51,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:51,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash -541511591, now seen corresponding path program 1 times
[2024-11-12 13:17:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:51,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459146078]
[2024-11-12 13:17:51,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:51,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:17:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-12 13:17:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459146078]
[2024-11-12 13:17:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459146078] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551178693]
[2024-11-12 13:17:52,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:52,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:52,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-12 13:17:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:52,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:52,175 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:52,528 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:52,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-12 13:17:52,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48
[2024-11-12 13:17:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-12 13:17:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551178693] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:17:52,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:17:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 27
[2024-11-12 13:17:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000284563]
[2024-11-12 13:17:52,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-11-12 13:17:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-11-12 13:17:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756
[2024-11-12 13:17:52,968 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 28 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-12 13:17:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:53,572 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions.
[2024-11-12 13:17:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-12 13:17:53,573 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33
[2024-11-12 13:17:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:53,574 INFO L225 Difference]: With dead ends: 91
[2024-11-12 13:17:53,574 INFO L226 Difference]: Without dead ends: 91
[2024-11-12 13:17:53,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560
[2024-11-12 13:17:53,575 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 148 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:53,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 320 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-12 13:17:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2024-11-12 13:17:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74.
[2024-11-12 13:17:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 65 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 13:17:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions.
[2024-11-12 13:17:53,584 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33
[2024-11-12 13:17:53,584 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:53,584 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions.
[2024-11-12 13:17:53,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)
[2024-11-12 13:17:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions.
[2024-11-12 13:17:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2024-11-12 13:17:53,585 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:53,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:53,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-12 13:17:53,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:53,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:53,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 77100966, now seen corresponding path program 1 times
[2024-11-12 13:17:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739949671]
[2024-11-12 13:17:53,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:17:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-12 13:17:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739949671]
[2024-11-12 13:17:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739949671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-12 13:17:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211354059]
[2024-11-12 13:17:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-12 13:17:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-12 13:17:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-12 13:17:53,941 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-12 13:17:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:54,089 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions.
[2024-11-12 13:17:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-12 13:17:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37
[2024-11-12 13:17:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:54,090 INFO L225 Difference]: With dead ends: 78
[2024-11-12 13:17:54,091 INFO L226 Difference]: Without dead ends: 78
[2024-11-12 13:17:54,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2024-11-12 13:17:54,092 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:54,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-12 13:17:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-12 13:17:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2024-11-12 13:17:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 13:17:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions.
[2024-11-12 13:17:54,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 37
[2024-11-12 13:17:54,101 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:54,101 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions.
[2024-11-12 13:17:54,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-12 13:17:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions.
[2024-11-12 13:17:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-11-12 13:17:54,102 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:54,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-12 13:17:54,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:54,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1720374250, now seen corresponding path program 1 times
[2024-11-12 13:17:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913470492]
[2024-11-12 13:17:54,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:17:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 13:17:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-12 13:17:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913470492]
[2024-11-12 13:17:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913470492] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115955001]
[2024-11-12 13:17:54,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:54,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:54,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-12 13:17:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:54,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:54,369 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-12 13:17:54,522 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-12 13:17:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115955001] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:17:54,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:17:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9
[2024-11-12 13:17:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144420290]
[2024-11-12 13:17:54,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-12 13:17:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-12 13:17:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-12 13:17:54,696 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:17:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:54,812 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions.
[2024-11-12 13:17:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-12 13:17:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41
[2024-11-12 13:17:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:54,813 INFO L225 Difference]: With dead ends: 91
[2024-11-12 13:17:54,813 INFO L226 Difference]: Without dead ends: 91
[2024-11-12 13:17:54,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2024-11-12 13:17:54,814 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:54,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 228 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-12 13:17:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2024-11-12 13:17:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2024-11-12 13:17:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 78 states have internal predecessors, (86), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-12 13:17:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions.
[2024-11-12 13:17:54,818 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 41
[2024-11-12 13:17:54,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions.
[2024-11-12 13:17:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:17:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions.
[2024-11-12 13:17:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2024-11-12 13:17:54,824 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:54,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:54,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-12 13:17:55,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-11-12 13:17:55,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 283032502, now seen corresponding path program 1 times
[2024-11-12 13:17:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093340325]
[2024-11-12 13:17:55,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:17:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 13:17:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-12 13:17:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093340325]
[2024-11-12 13:17:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093340325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:17:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:17:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-12 13:17:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176039432]
[2024-11-12 13:17:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:17:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-12 13:17:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-12 13:17:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-12 13:17:55,082 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:17:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:17:55,112 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions.
[2024-11-12 13:17:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-12 13:17:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43
[2024-11-12 13:17:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:17:55,113 INFO L225 Difference]: With dead ends: 90
[2024-11-12 13:17:55,113 INFO L226 Difference]: Without dead ends: 90
[2024-11-12 13:17:55,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-12 13:17:55,114 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-12 13:17:55,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-12 13:17:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2024-11-12 13:17:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90.
[2024-11-12 13:17:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 77 states have internal predecessors, (85), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-12 13:17:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions.
[2024-11-12 13:17:55,118 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 43
[2024-11-12 13:17:55,118 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:17:55,118 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions.
[2024-11-12 13:17:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:17:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions.
[2024-11-12 13:17:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-12 13:17:55,119 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:17:55,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:17:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-12 13:17:55,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:17:55,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:17:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -900725447, now seen corresponding path program 1 times
[2024-11-12 13:17:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:17:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958433168]
[2024-11-12 13:17:55,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:17:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:17:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:17:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-12 13:17:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2024-11-12 13:17:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:17:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:17:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958433168]
[2024-11-12 13:17:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958433168] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:17:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996946456]
[2024-11-12 13:17:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:17:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:17:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:17:55,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:17:55,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-12 13:17:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:17:55,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 40 conjuncts are in the unsatisfiable core
[2024-11-12 13:17:55,347 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:17:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-12 13:17:55,635 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:17:55,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-12 13:17:55,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42
[2024-11-12 13:17:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:17:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996946456] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:17:55,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:17:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22
[2024-11-12 13:17:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444723420]
[2024-11-12 13:17:55,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:17:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-11-12 13:17:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:17:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-12 13:17:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2024-11-12 13:17:55,937 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2024-11-12 13:18:00,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-11-12 13:18:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:18:00,424 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions.
[2024-11-12 13:18:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-12 13:18:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44
[2024-11-12 13:18:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:18:00,425 INFO L225 Difference]: With dead ends: 89
[2024-11-12 13:18:00,425 INFO L226 Difference]: Without dead ends: 89
[2024-11-12 13:18:00,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056
[2024-11-12 13:18:00,426 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time
[2024-11-12 13:18:00,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 411 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time]
[2024-11-12 13:18:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2024-11-12 13:18:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70.
[2024-11-12 13:18:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.087719298245614) internal successors, (62), 60 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 13:18:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions.
[2024-11-12 13:18:00,430 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 44
[2024-11-12 13:18:00,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:18:00,430 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions.
[2024-11-12 13:18:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2024-11-12 13:18:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions.
[2024-11-12 13:18:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-12 13:18:00,431 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:18:00,431 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:18:00,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-11-12 13:18:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-11-12 13:18:00,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:18:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:18:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1006202919, now seen corresponding path program 2 times
[2024-11-12 13:18:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:18:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163518392]
[2024-11-12 13:18:00,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:18:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:18:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:18:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:18:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 13:18:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-12 13:18:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:18:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163518392]
[2024-11-12 13:18:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163518392] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:18:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811727663]
[2024-11-12 13:18:01,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-12 13:18:01,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:18:01,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:18:01,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:18:01,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-12 13:18:01,195 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-12 13:18:01,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-12 13:18:01,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 46 conjuncts are in the unsatisfiable core
[2024-11-12 13:18:01,202 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:18:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:18:01,466 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:18:01,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-12 13:18:01,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48
[2024-11-12 13:18:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:18:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811727663] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:18:01,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:18:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 25
[2024-11-12 13:18:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083507631]
[2024-11-12 13:18:01,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:18:01,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-12 13:18:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:18:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-12 13:18:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650
[2024-11-12 13:18:01,917 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-12 13:18:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:18:02,214 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions.
[2024-11-12 13:18:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-12 13:18:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44
[2024-11-12 13:18:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:18:02,215 INFO L225 Difference]: With dead ends: 69
[2024-11-12 13:18:02,215 INFO L226 Difference]: Without dead ends: 69
[2024-11-12 13:18:02,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056
[2024-11-12 13:18:02,216 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-12 13:18:02,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 268 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-12 13:18:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2024-11-12 13:18:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2024-11-12 13:18:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 13:18:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions.
[2024-11-12 13:18:02,219 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 44
[2024-11-12 13:18:02,219 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:18:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions.
[2024-11-12 13:18:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-12 13:18:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions.
[2024-11-12 13:18:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-12 13:18:02,220 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:18:02,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:18:02,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-12 13:18:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:18:02,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:18:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:18:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1411297849, now seen corresponding path program 1 times
[2024-11-12 13:18:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:18:02,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140949124]
[2024-11-12 13:18:02,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:18:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:18:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:18:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:18:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-12 13:18:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 13:18:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-12 13:18:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:18:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140949124]
[2024-11-12 13:18:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140949124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 13:18:02,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 13:18:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-12 13:18:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566357956]
[2024-11-12 13:18:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 13:18:02,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-12 13:18:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:18:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-12 13:18:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-12 13:18:02,532 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:18:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:18:02,578 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions.
[2024-11-12 13:18:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-12 13:18:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45
[2024-11-12 13:18:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:18:02,579 INFO L225 Difference]: With dead ends: 68
[2024-11-12 13:18:02,579 INFO L226 Difference]: Without dead ends: 42
[2024-11-12 13:18:02,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-12 13:18:02,580 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-12 13:18:02,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-12 13:18:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2024-11-12 13:18:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2024-11-12 13:18:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-12 13:18:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions.
[2024-11-12 13:18:02,584 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 45
[2024-11-12 13:18:02,584 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:18:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions.
[2024-11-12 13:18:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-12 13:18:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions.
[2024-11-12 13:18:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-12 13:18:02,585 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-12 13:18:02,585 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:18:02,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-12 13:18:02,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] ===
[2024-11-12 13:18:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 13:18:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1127519435, now seen corresponding path program 2 times
[2024-11-12 13:18:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 13:18:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13589779]
[2024-11-12 13:18:02,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 13:18:02,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 13:18:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 13:18:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 13:18:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 13:18:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 13:18:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-12 13:18:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 13:18:03,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13589779]
[2024-11-12 13:18:03,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13589779] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 13:18:03,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020052238]
[2024-11-12 13:18:03,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-12 13:18:03,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 13:18:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 13:18:03,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 13:18:03,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-12 13:18:03,196 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-12 13:18:03,196 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-12 13:18:03,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjuncts are in the unsatisfiable core
[2024-11-12 13:18:03,201 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 13:18:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:18:03,468 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 13:18:03,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-12 13:18:03,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48
[2024-11-12 13:18:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-12 13:18:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020052238] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 13:18:03,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 13:18:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 29
[2024-11-12 13:18:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342484098]
[2024-11-12 13:18:03,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 13:18:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-11-12 13:18:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 13:18:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-11-12 13:18:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870
[2024-11-12 13:18:03,882 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 30 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)
[2024-11-12 13:18:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 13:18:04,260 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions.
[2024-11-12 13:18:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-12 13:18:04,260 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45
[2024-11-12 13:18:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 13:18:04,260 INFO L225 Difference]: With dead ends: 41
[2024-11-12 13:18:04,260 INFO L226 Difference]: Without dead ends: 0
[2024-11-12 13:18:04,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332
[2024-11-12 13:18:04,261 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-12 13:18:04,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 138 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-12 13:18:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-12 13:18:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-12 13:18:04,262 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-11-12 13:18:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-12 13:18:04,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45
[2024-11-12 13:18:04,262 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-12 13:18:04,262 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-12 13:18:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)
[2024-11-12 13:18:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-12 13:18:04,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-12 13:18:04,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining)
[2024-11-12 13:18:04,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining)
[2024-11-12 13:18:04,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (4 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (3 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (2 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (1 of 17 remaining)
[2024-11-12 13:18:04,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining)
[2024-11-12 13:18:04,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-11-12 13:18:04,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-12 13:18:04,472 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 13:18:04,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-12 13:18:04,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:18:04 BoogieIcfgContainer
[2024-11-12 13:18:04,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-12 13:18:04,476 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-12 13:18:04,476 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-12 13:18:04,477 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-12 13:18:04,477 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:17:40" (3/4) ...
[2024-11-12 13:18:04,479 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-12 13:18:04,484 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not
[2024-11-12 13:18:04,484 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert
[2024-11-12 13:18:04,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges
[2024-11-12 13:18:04,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges
[2024-11-12 13:18:04,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2024-11-12 13:18:04,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-12 13:18:04,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-12 13:18:04,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-12 13:18:04,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-12 13:18:04,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-12 13:18:04,651 INFO L158 Benchmark]: Toolchain (without parser) took 25335.53ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 114.7MB in the beginning and 167.2MB in the end (delta: -52.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,652 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-12 13:18:04,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.05ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 136.0MB in the end (delta: -21.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,652 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 169.9MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,653 INFO L158 Benchmark]: RCFGBuilder took 434.75ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 113.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,653 INFO L158 Benchmark]: TraceAbstraction took 24339.02ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 112.9MB in the beginning and 175.0MB in the end (delta: -62.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,653 INFO L158 Benchmark]: Witness Printer took 170.79ms. Allocated memory is still 237.0MB. Free memory was 175.0MB in the beginning and 167.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-12 13:18:04,655 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.18ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 300.05ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 136.0MB in the end (delta: -21.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 39.91ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 40.80ms. Allocated memory is still 169.9MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 434.75ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 113.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 24339.02ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 112.9MB in the beginning and 175.0MB in the end (delta: -62.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
* Witness Printer took 170.79ms. Allocated memory is still 237.0MB. Free memory was 175.0MB in the beginning and 167.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. 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: -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: -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: 47]: free always succeeds
For all program executions holds that free always succeeds at this location
- PositiveResult [Line: 47]: free always succeeds
For all program executions holds that free always succeeds at this location
- PositiveResult [Line: 47]: free always succeeds
For all program executions holds that free always succeeds at this location
- PositiveResult [Line: 35]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 11]: 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 3 procedures, 58 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 880 mSDsluCounter, 4137 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3472 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4456 IncrementalHoareTripleChecker+Invalid, 4537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 665 mSDtfsCounter, 4456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 554 SyntacticMatches, 6 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 80 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1077 ConstructedInterpolants, 27 QuantifiedInterpolants, 11404 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 364/551 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
17 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-11-12 13:18:04,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE