./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:39:51,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:39:51,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:39:51,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:39:51,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:39:51,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:39:51,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:39:51,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:39:51,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:39:51,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:39:51,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:39:51,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:39:51,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:39:51,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:39:51,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:39:51,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:39:51,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:39:51,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:39:51,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:39:51,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:39:51,925 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:39:51,926 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:39:51,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:39:51,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:39:51,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:39:51,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:39:51,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:39:51,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:39:51,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:39:51,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:39:51,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:39:51,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:39:51,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:39:51,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:39:51,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:39:51,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:39:51,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:39:51,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:39:51,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:39:51,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:39:51,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:39:51,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:39:51,932 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2024-11-22 18:39:52,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:39:52,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:39:52,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:39:52,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:39:52,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:39:52,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2024-11-22 18:39:53,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:39:53,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:39:53,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2024-11-22 18:39:53,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3f3e629/bc11b1632e46492f84152c73033c7cac/FLAGc3389a576 [2024-11-22 18:39:53,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3f3e629/bc11b1632e46492f84152c73033c7cac [2024-11-22 18:39:53,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:39:53,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:39:53,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:39:53,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:39:53,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:39:53,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:39:53" (1/1) ... [2024-11-22 18:39:53,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d3e947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:53, skipping insertion in model container [2024-11-22 18:39:53,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:39:53" (1/1) ... [2024-11-22 18:39:53,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:39:54,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:39:54,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:39:54,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:39:54,188 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:39:54,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54 WrapperNode [2024-11-22 18:39:54,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:39:54,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:39:54,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:39:54,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:39:54,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,221 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2024-11-22 18:39:54,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:39:54,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:39:54,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:39:54,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:39:54,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,242 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-22 18:39:54,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:39:54,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:39:54,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:39:54,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:39:54,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (1/1) ... [2024-11-22 18:39:54,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:39:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:54,298 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-22 18:39:54,301 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-22 18:39:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:39:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:39:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:39:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:39:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:39:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:39:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:39:54,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:39:54,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:39:54,613 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-22 18:39:54,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:39:54,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:39:54,630 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:39:54,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:39:54 BoogieIcfgContainer [2024-11-22 18:39:54,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:39:54,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:39:54,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:39:54,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:39:54,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:39:53" (1/3) ... [2024-11-22 18:39:54,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf43d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:39:54, skipping insertion in model container [2024-11-22 18:39:54,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:39:54" (2/3) ... [2024-11-22 18:39:54,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf43d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:39:54, skipping insertion in model container [2024-11-22 18:39:54,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:39:54" (3/3) ... [2024-11-22 18:39:54,640 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2024-11-22 18:39:54,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:39:54,653 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-22 18:39:54,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:39:54,691 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;@10fbb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:39:54,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-22 18:39:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:39:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:39:54,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:54,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:39:54,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-22 18:39:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:54,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656298071] [2024-11-22 18:39:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656298071] [2024-11-22 18:39:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656298071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:39:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243263832] [2024-11-22 18:39:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:54,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:39:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:54,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:39:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:39:54,972 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:54,998 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-22 18:39:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:39:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 18:39:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:55,012 INFO L225 Difference]: With dead ends: 64 [2024-11-22 18:39:55,012 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 18:39:55,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-22 18:39:55,020 INFO L432 NwaCegarLoop]: 81 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, 81 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-22 18:39:55,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 18:39:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-22 18:39:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-22 18:39:55,054 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-22 18:39:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:55,055 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-22 18:39:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-22 18:39:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:39:55,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:55,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:55,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:39:55,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:55,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-22 18:39:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74215626] [2024-11-22 18:39:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74215626] [2024-11-22 18:39:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74215626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:55,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:39:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198762671] [2024-11-22 18:39:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:55,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:39:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:39:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,153 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:55,181 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-11-22 18:39:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:39:55,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:39:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:55,188 INFO L225 Difference]: With dead ends: 63 [2024-11-22 18:39:55,188 INFO L226 Difference]: Without dead ends: 63 [2024-11-22 18:39:55,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,189 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:55,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-22 18:39:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-22 18:39:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-22 18:39:55,205 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2024-11-22 18:39:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-22 18:39:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-22 18:39:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:39:55,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:55,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:55,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:39:55,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-22 18:39:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767610792] [2024-11-22 18:39:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:55,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767610792] [2024-11-22 18:39:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767610792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:55,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:39:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193226710] [2024-11-22 18:39:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:39:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:39:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,348 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:55,402 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2024-11-22 18:39:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:39:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:39:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:55,404 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:39:55,405 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 18:39:55,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,407 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:55,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 18:39:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-22 18:39:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 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-22 18:39:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-22 18:39:55,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2024-11-22 18:39:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-22 18:39:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-22 18:39:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:39:55,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:55,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:55,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:39:55,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:55,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2024-11-22 18:39:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065828341] [2024-11-22 18:39:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065828341] [2024-11-22 18:39:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065828341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:39:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084437449] [2024-11-22 18:39:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:39:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:39:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:55,629 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:55,726 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2024-11-22 18:39:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:39:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:39:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:55,733 INFO L225 Difference]: With dead ends: 148 [2024-11-22 18:39:55,733 INFO L226 Difference]: Without dead ends: 148 [2024-11-22 18:39:55,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:39:55,734 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 209 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:39:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-22 18:39:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2024-11-22 18:39:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.841121495327103) internal successors, (197), 126 states have internal predecessors, (197), 0 states have call successors, (0), 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-22 18:39:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2024-11-22 18:39:55,757 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 8 [2024-11-22 18:39:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:55,758 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2024-11-22 18:39:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-11-22 18:39:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:39:55,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:55,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:39:55,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-22 18:39:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405451242] [2024-11-22 18:39:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405451242] [2024-11-22 18:39:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405451242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:39:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862062420] [2024-11-22 18:39:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:39:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:39:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,856 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:55,944 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2024-11-22 18:39:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:39:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:39:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:55,945 INFO L225 Difference]: With dead ends: 209 [2024-11-22 18:39:55,945 INFO L226 Difference]: Without dead ends: 206 [2024-11-22 18:39:55,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:55,948 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:55,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:39:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-22 18:39:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2024-11-22 18:39:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.8363636363636364) internal successors, (303), 184 states have internal predecessors, (303), 0 states have call successors, (0), 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-22 18:39:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 303 transitions. [2024-11-22 18:39:55,985 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 303 transitions. Word has length 8 [2024-11-22 18:39:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:55,985 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 303 transitions. [2024-11-22 18:39:55,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 303 transitions. [2024-11-22 18:39:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:39:55,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:55,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:55,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:39:55,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-22 18:39:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:55,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891963428] [2024-11-22 18:39:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891963428] [2024-11-22 18:39:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891963428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:39:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504032467] [2024-11-22 18:39:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:56,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:39:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:39:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:56,136 INFO L87 Difference]: Start difference. First operand 185 states and 303 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:56,268 INFO L93 Difference]: Finished difference Result 261 states and 411 transitions. [2024-11-22 18:39:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:39:56,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:39:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:56,274 INFO L225 Difference]: With dead ends: 261 [2024-11-22 18:39:56,274 INFO L226 Difference]: Without dead ends: 261 [2024-11-22 18:39:56,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:56,275 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:56,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:39:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-22 18:39:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2024-11-22 18:39:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 222 states have (on average 1.7882882882882882) internal successors, (397), 239 states have internal predecessors, (397), 0 states have call successors, (0), 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-22 18:39:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 397 transitions. [2024-11-22 18:39:56,299 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 397 transitions. Word has length 8 [2024-11-22 18:39:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:56,299 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 397 transitions. [2024-11-22 18:39:56,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 397 transitions. [2024-11-22 18:39:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:39:56,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:56,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:56,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:39:56,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-22 18:39:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68139416] [2024-11-22 18:39:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68139416] [2024-11-22 18:39:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68139416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:39:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77555079] [2024-11-22 18:39:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:39:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:56,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:39:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:56,463 INFO L87 Difference]: Start difference. First operand 240 states and 397 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:56,527 INFO L93 Difference]: Finished difference Result 256 states and 402 transitions. [2024-11-22 18:39:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:39:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:39:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:56,529 INFO L225 Difference]: With dead ends: 256 [2024-11-22 18:39:56,532 INFO L226 Difference]: Without dead ends: 256 [2024-11-22 18:39:56,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:39:56,533 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:56,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:39:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-22 18:39:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2024-11-22 18:39:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 222 states have (on average 1.7522522522522523) internal successors, (389), 237 states have internal predecessors, (389), 0 states have call successors, (0), 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-22 18:39:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 389 transitions. [2024-11-22 18:39:56,548 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 389 transitions. Word has length 8 [2024-11-22 18:39:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:56,548 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 389 transitions. [2024-11-22 18:39:56,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 389 transitions. [2024-11-22 18:39:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:39:56,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:56,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:56,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:39:56,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-22 18:39:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255309988] [2024-11-22 18:39:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255309988] [2024-11-22 18:39:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255309988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:39:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070881217] [2024-11-22 18:39:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:39:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:39:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:56,633 INFO L87 Difference]: Start difference. First operand 238 states and 389 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:56,654 INFO L93 Difference]: Finished difference Result 218 states and 328 transitions. [2024-11-22 18:39:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:39:56,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 18:39:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:56,656 INFO L225 Difference]: With dead ends: 218 [2024-11-22 18:39:56,656 INFO L226 Difference]: Without dead ends: 218 [2024-11-22 18:39:56,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:56,657 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:56,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-22 18:39:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 195. [2024-11-22 18:39:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.6994535519125684) internal successors, (311), 194 states have internal predecessors, (311), 0 states have call successors, (0), 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-22 18:39:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2024-11-22 18:39:56,660 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 9 [2024-11-22 18:39:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:56,661 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2024-11-22 18:39:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2024-11-22 18:39:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:39:56,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:56,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:56,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:39:56,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:56,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-22 18:39:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988790843] [2024-11-22 18:39:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988790843] [2024-11-22 18:39:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988790843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:39:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:39:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:39:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182665215] [2024-11-22 18:39:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:39:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:39:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:39:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:56,690 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:56,707 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2024-11-22 18:39:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:39:56,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 18:39:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:56,708 INFO L225 Difference]: With dead ends: 294 [2024-11-22 18:39:56,708 INFO L226 Difference]: Without dead ends: 294 [2024-11-22 18:39:56,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:56,709 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:56,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 192 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-22 18:39:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 278. [2024-11-22 18:39:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 277 states have internal predecessors, (428), 0 states have call successors, (0), 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-22 18:39:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2024-11-22 18:39:56,713 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 10 [2024-11-22 18:39:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2024-11-22 18:39:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2024-11-22 18:39:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:39:56,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:56,714 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:39:56,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2024-11-22 18:39:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089037867] [2024-11-22 18:39:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089037867] [2024-11-22 18:39:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089037867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003784303] [2024-11-22 18:39:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:56,771 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-22 18:39:56,772 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-22 18:39:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:56,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:39:56,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003784303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:56,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-22 18:39:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692306853] [2024-11-22 18:39:56,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:39:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:39:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:39:56,895 INFO L87 Difference]: Start difference. First operand 278 states and 428 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-22 18:39:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:56,925 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2024-11-22 18:39:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:39:56,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:39:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:56,927 INFO L225 Difference]: With dead ends: 282 [2024-11-22 18:39:56,927 INFO L226 Difference]: Without dead ends: 282 [2024-11-22 18:39:56,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:39:56,927 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 183 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:56,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-22 18:39:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2024-11-22 18:39:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 262 states have (on average 1.5877862595419847) internal successors, (416), 273 states have internal predecessors, (416), 0 states have call successors, (0), 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-22 18:39:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 416 transitions. [2024-11-22 18:39:56,931 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 416 transitions. Word has length 16 [2024-11-22 18:39:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:56,932 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 416 transitions. [2024-11-22 18:39:56,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-22 18:39:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 416 transitions. [2024-11-22 18:39:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:39:56,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:56,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:56,940 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-22 18:39:57,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 18:39:57,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1902356162, now seen corresponding path program 1 times [2024-11-22 18:39:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:57,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000827673] [2024-11-22 18:39:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000827673] [2024-11-22 18:39:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000827673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973244742] [2024-11-22 18:39:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:57,206 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-22 18:39:57,207 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-22 18:39:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:57,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:39:57,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:57,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973244742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:57,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 18:39:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245919479] [2024-11-22 18:39:57,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:57,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:39:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:39:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:39:57,342 INFO L87 Difference]: Start difference. First operand 274 states and 416 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-22 18:39:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:57,393 INFO L93 Difference]: Finished difference Result 443 states and 639 transitions. [2024-11-22 18:39:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:39:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:39:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:57,395 INFO L225 Difference]: With dead ends: 443 [2024-11-22 18:39:57,395 INFO L226 Difference]: Without dead ends: 443 [2024-11-22 18:39:57,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:39:57,396 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:57,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 367 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-22 18:39:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 387. [2024-11-22 18:39:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.5333333333333334) internal successors, (575), 386 states have internal predecessors, (575), 0 states have call successors, (0), 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-22 18:39:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 575 transitions. [2024-11-22 18:39:57,403 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 575 transitions. Word has length 16 [2024-11-22 18:39:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:57,403 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 575 transitions. [2024-11-22 18:39:57,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-22 18:39:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2024-11-22 18:39:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:39:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:57,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:57,411 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-22 18:39:57,605 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,SelfDestructingSolverStorable10 [2024-11-22 18:39:57,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 53823374, now seen corresponding path program 2 times [2024-11-22 18:39:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737905902] [2024-11-22 18:39:57,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:39:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:57,617 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:39:57,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:39:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:39:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737905902] [2024-11-22 18:39:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737905902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878702371] [2024-11-22 18:39:57,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:39:57,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:57,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:57,679 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-22 18:39:57,681 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-22 18:39:57,730 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:39:57,730 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:39:57,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:39:57,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:57,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878702371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:57,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-11-22 18:39:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048218849] [2024-11-22 18:39:57,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:39:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:39:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:39:57,787 INFO L87 Difference]: Start difference. First operand 387 states and 575 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:57,867 INFO L93 Difference]: Finished difference Result 443 states and 623 transitions. [2024-11-22 18:39:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:39:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 18:39:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:57,869 INFO L225 Difference]: With dead ends: 443 [2024-11-22 18:39:57,869 INFO L226 Difference]: Without dead ends: 443 [2024-11-22 18:39:57,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:39:57,870 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 292 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:57,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 386 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-22 18:39:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 387. [2024-11-22 18:39:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.4906666666666666) internal successors, (559), 386 states have internal predecessors, (559), 0 states have call successors, (0), 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-22 18:39:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 559 transitions. [2024-11-22 18:39:57,877 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 559 transitions. Word has length 22 [2024-11-22 18:39:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:57,877 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 559 transitions. [2024-11-22 18:39:57,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 559 transitions. [2024-11-22 18:39:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:39:57,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:57,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:57,885 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-22 18:39:58,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:58,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:58,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2107196217, now seen corresponding path program 1 times [2024-11-22 18:39:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719491181] [2024-11-22 18:39:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719491181] [2024-11-22 18:39:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719491181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469189986] [2024-11-22 18:39:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:58,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:58,148 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-22 18:39:58,152 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-22 18:39:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:58,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:39:58,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469189986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:58,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-22 18:39:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955804303] [2024-11-22 18:39:58,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:39:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:39:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:39:58,290 INFO L87 Difference]: Start difference. First operand 387 states and 559 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:58,350 INFO L93 Difference]: Finished difference Result 927 states and 1321 transitions. [2024-11-22 18:39:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:39:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 18:39:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:58,353 INFO L225 Difference]: With dead ends: 927 [2024-11-22 18:39:58,353 INFO L226 Difference]: Without dead ends: 927 [2024-11-22 18:39:58,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:39:58,353 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 176 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:58,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 163 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-22 18:39:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 806. [2024-11-22 18:39:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 794 states have (on average 1.4748110831234258) internal successors, (1171), 805 states have internal predecessors, (1171), 0 states have call successors, (0), 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-22 18:39:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1171 transitions. [2024-11-22 18:39:58,366 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1171 transitions. Word has length 24 [2024-11-22 18:39:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:58,367 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1171 transitions. [2024-11-22 18:39:58,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1171 transitions. [2024-11-22 18:39:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:39:58,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:58,368 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:58,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 18:39:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:58,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2024-11-22 18:39:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:58,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640975360] [2024-11-22 18:39:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640975360] [2024-11-22 18:39:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640975360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578430208] [2024-11-22 18:39:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:58,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:58,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:58,724 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-22 18:39:58,725 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-22 18:39:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:58,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:39:58,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:39:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578430208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:58,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-22 18:39:58,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82924445] [2024-11-22 18:39:58,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:58,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:39:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:39:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:39:58,901 INFO L87 Difference]: Start difference. First operand 806 states and 1171 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:59,059 INFO L93 Difference]: Finished difference Result 2042 states and 2823 transitions. [2024-11-22 18:39:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:39:59,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:39:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:59,071 INFO L225 Difference]: With dead ends: 2042 [2024-11-22 18:39:59,071 INFO L226 Difference]: Without dead ends: 2042 [2024-11-22 18:39:59,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:39:59,071 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 236 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:59,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 450 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:39:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2024-11-22 18:39:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1874. [2024-11-22 18:39:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1862 states have (on average 1.4301825993555317) internal successors, (2663), 1873 states have internal predecessors, (2663), 0 states have call successors, (0), 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-22 18:39:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2663 transitions. [2024-11-22 18:39:59,132 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2663 transitions. Word has length 27 [2024-11-22 18:39:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:59,133 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2663 transitions. [2024-11-22 18:39:59,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:39:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2663 transitions. [2024-11-22 18:39:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:39:59,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:59,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:59,149 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-22 18:39:59,339 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,SelfDestructingSolverStorable13 [2024-11-22 18:39:59,339 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:59,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash 334990594, now seen corresponding path program 1 times [2024-11-22 18:39:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003792127] [2024-11-22 18:39:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:39:59,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003792127] [2024-11-22 18:39:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003792127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781290422] [2024-11-22 18:39:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:59,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:59,489 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-22 18:39:59,491 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-22 18:39:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:59,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:39:59,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:39:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:39:59,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:39:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:39:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781290422] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:39:59,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:39:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-22 18:39:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902684575] [2024-11-22 18:39:59,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:39:59,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:39:59,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:39:59,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:39:59,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:39:59,582 INFO L87 Difference]: Start difference. First operand 1874 states and 2663 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:39:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:39:59,626 INFO L93 Difference]: Finished difference Result 943 states and 1292 transitions. [2024-11-22 18:39:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:39:59,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:39:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:39:59,628 INFO L225 Difference]: With dead ends: 943 [2024-11-22 18:39:59,628 INFO L226 Difference]: Without dead ends: 943 [2024-11-22 18:39:59,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:39:59,629 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 80 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:39:59,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 435 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:39:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-22 18:39:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 883. [2024-11-22 18:39:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 871 states have (on average 1.4029850746268657) internal successors, (1222), 882 states have internal predecessors, (1222), 0 states have call successors, (0), 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-22 18:39:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1222 transitions. [2024-11-22 18:39:59,638 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1222 transitions. Word has length 27 [2024-11-22 18:39:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:39:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1222 transitions. [2024-11-22 18:39:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:39:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1222 transitions. [2024-11-22 18:39:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:39:59,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:39:59,640 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:39:59,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:39:59,843 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-22 18:39:59,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:39:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:39:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2024-11-22 18:39:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:39:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279278762] [2024-11-22 18:39:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:39:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:39:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-22 18:39:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:39:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279278762] [2024-11-22 18:39:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279278762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:39:59,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652120621] [2024-11-22 18:39:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:39:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:39:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:39:59,954 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-22 18:39:59,963 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-22 18:40:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:00,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:40:00,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:00,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652120621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:00,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2024-11-22 18:40:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954102812] [2024-11-22 18:40:00,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:40:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:00,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:40:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:40:00,243 INFO L87 Difference]: Start difference. First operand 883 states and 1222 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:00,500 INFO L93 Difference]: Finished difference Result 1660 states and 2220 transitions. [2024-11-22 18:40:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 18:40:00,501 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-22 18:40:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:00,504 INFO L225 Difference]: With dead ends: 1660 [2024-11-22 18:40:00,504 INFO L226 Difference]: Without dead ends: 1660 [2024-11-22 18:40:00,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2024-11-22 18:40:00,506 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 442 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:00,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 709 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-22 18:40:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 982. [2024-11-22 18:40:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 970 states have (on average 1.4195876288659794) internal successors, (1377), 981 states have internal predecessors, (1377), 0 states have call successors, (0), 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-22 18:40:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1377 transitions. [2024-11-22 18:40:00,520 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1377 transitions. Word has length 51 [2024-11-22 18:40:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:00,522 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1377 transitions. [2024-11-22 18:40:00,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1377 transitions. [2024-11-22 18:40:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 18:40:00,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:00,523 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:00,531 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-22 18:40:00,723 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-22 18:40:00,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2024-11-22 18:40:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593073990] [2024-11-22 18:40:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-22 18:40:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593073990] [2024-11-22 18:40:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593073990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285935531] [2024-11-22 18:40:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:00,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:00,829 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-22 18:40:00,830 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-22 18:40:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:00,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:40:00,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 18:40:00,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 18:40:01,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285935531] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:01,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2024-11-22 18:40:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139880243] [2024-11-22 18:40:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:40:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:40:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:40:01,006 INFO L87 Difference]: Start difference. First operand 982 states and 1377 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:01,091 INFO L93 Difference]: Finished difference Result 1690 states and 2312 transitions. [2024-11-22 18:40:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:40:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-22 18:40:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:01,096 INFO L225 Difference]: With dead ends: 1690 [2024-11-22 18:40:01,096 INFO L226 Difference]: Without dead ends: 1690 [2024-11-22 18:40:01,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:40:01,096 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 99 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:01,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-11-22 18:40:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1630. [2024-11-22 18:40:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1618 states have (on average 1.3955500618046972) internal successors, (2258), 1629 states have internal predecessors, (2258), 0 states have call successors, (0), 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-22 18:40:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2258 transitions. [2024-11-22 18:40:01,118 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2258 transitions. Word has length 59 [2024-11-22 18:40:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:01,119 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2258 transitions. [2024-11-22 18:40:01,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2258 transitions. [2024-11-22 18:40:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 18:40:01,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:01,120 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:01,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 18:40:01,320 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,SelfDestructingSolverStorable16 [2024-11-22 18:40:01,321 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2024-11-22 18:40:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091631462] [2024-11-22 18:40:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 18:40:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091631462] [2024-11-22 18:40:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091631462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588590526] [2024-11-22 18:40:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:01,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:01,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:01,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:40:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:01,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:40:01,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-22 18:40:01,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-22 18:40:01,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588590526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:01,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:01,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2024-11-22 18:40:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57743890] [2024-11-22 18:40:01,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:40:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:01,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:40:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:40:01,603 INFO L87 Difference]: Start difference. First operand 1630 states and 2258 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:40:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:02,473 INFO L93 Difference]: Finished difference Result 6677 states and 9132 transitions. [2024-11-22 18:40:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-22 18:40:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-22 18:40:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:02,488 INFO L225 Difference]: With dead ends: 6677 [2024-11-22 18:40:02,489 INFO L226 Difference]: Without dead ends: 6677 [2024-11-22 18:40:02,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2024-11-22 18:40:02,490 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 653 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:02,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 642 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:40:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-22 18:40:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 4623. [2024-11-22 18:40:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4612 states have (on average 1.419340849956635) internal successors, (6546), 4622 states have internal predecessors, (6546), 0 states have call successors, (0), 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-22 18:40:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6546 transitions. [2024-11-22 18:40:02,552 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6546 transitions. Word has length 59 [2024-11-22 18:40:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:02,552 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 6546 transitions. [2024-11-22 18:40:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:40:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6546 transitions. [2024-11-22 18:40:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:40:02,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:02,554 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:02,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 18:40:02,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 18:40:02,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2024-11-22 18:40:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987276879] [2024-11-22 18:40:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-22 18:40:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987276879] [2024-11-22 18:40:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987276879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743660596] [2024-11-22 18:40:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:02,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:02,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:40:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:02,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:40:02,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:40:03,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:40:03,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743660596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:03,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:03,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-22 18:40:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772971592] [2024-11-22 18:40:03,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:03,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:40:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:40:03,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:40:03,095 INFO L87 Difference]: Start difference. First operand 4623 states and 6546 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:40:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:03,515 INFO L93 Difference]: Finished difference Result 7300 states and 10003 transitions. [2024-11-22 18:40:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-22 18:40:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-22 18:40:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:03,533 INFO L225 Difference]: With dead ends: 7300 [2024-11-22 18:40:03,533 INFO L226 Difference]: Without dead ends: 7300 [2024-11-22 18:40:03,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2024-11-22 18:40:03,534 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 388 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:03,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 920 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2024-11-22 18:40:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 4423. [2024-11-22 18:40:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 4412 states have (on average 1.394605621033545) internal successors, (6153), 4422 states have internal predecessors, (6153), 0 states have call successors, (0), 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-22 18:40:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 6153 transitions. [2024-11-22 18:40:03,611 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 6153 transitions. Word has length 63 [2024-11-22 18:40:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:03,611 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 6153 transitions. [2024-11-22 18:40:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:40:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 6153 transitions. [2024-11-22 18:40:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:40:03,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:03,612 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2024-11-22 18:40:03,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 18:40:03,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:03,813 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2024-11-22 18:40:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679953348] [2024-11-22 18:40:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:03,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-22 18:40:03,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679953348] [2024-11-22 18:40:03,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679953348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455106198] [2024-11-22 18:40:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:03,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:03,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:03,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 18:40:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:03,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:40:03,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 18:40:04,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 18:40:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455106198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:04,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-22 18:40:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811321436] [2024-11-22 18:40:04,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:40:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:40:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:40:04,089 INFO L87 Difference]: Start difference. First operand 4423 states and 6153 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 18:40:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:04,269 INFO L93 Difference]: Finished difference Result 2957 states and 3819 transitions. [2024-11-22 18:40:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:40:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-22 18:40:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:04,276 INFO L225 Difference]: With dead ends: 2957 [2024-11-22 18:40:04,276 INFO L226 Difference]: Without dead ends: 2957 [2024-11-22 18:40:04,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:40:04,277 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 330 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:04,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1452 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-11-22 18:40:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2863. [2024-11-22 18:40:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2863 states, 2852 states have (on average 1.3131136044880785) internal successors, (3745), 2862 states have internal predecessors, (3745), 0 states have call successors, (0), 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-22 18:40:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 3745 transitions. [2024-11-22 18:40:04,301 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 3745 transitions. Word has length 63 [2024-11-22 18:40:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:04,301 INFO L471 AbstractCegarLoop]: Abstraction has 2863 states and 3745 transitions. [2024-11-22 18:40:04,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 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-22 18:40:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3745 transitions. [2024-11-22 18:40:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 18:40:04,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:04,302 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:04,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-22 18:40:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:04,503 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2024-11-22 18:40:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697772204] [2024-11-22 18:40:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 18:40:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697772204] [2024-11-22 18:40:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697772204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516563889] [2024-11-22 18:40:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:04,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:04,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:04,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:04,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 18:40:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:04,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:40:04,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 18:40:04,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 18:40:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516563889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:04,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:04,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-22 18:40:04,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705805473] [2024-11-22 18:40:04,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:04,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:40:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:40:04,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:40:04,817 INFO L87 Difference]: Start difference. First operand 2863 states and 3745 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:04,873 INFO L93 Difference]: Finished difference Result 2859 states and 3714 transitions. [2024-11-22 18:40:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:40:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-22 18:40:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:04,878 INFO L225 Difference]: With dead ends: 2859 [2024-11-22 18:40:04,878 INFO L226 Difference]: Without dead ends: 2859 [2024-11-22 18:40:04,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:04,879 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 108 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:04,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 253 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-11-22 18:40:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2852. [2024-11-22 18:40:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2841 states have (on average 1.30658218936994) internal successors, (3712), 2851 states have internal predecessors, (3712), 0 states have call successors, (0), 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-22 18:40:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3712 transitions. [2024-11-22 18:40:04,914 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3712 transitions. Word has length 64 [2024-11-22 18:40:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:04,915 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3712 transitions. [2024-11-22 18:40:04,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3712 transitions. [2024-11-22 18:40:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 18:40:04,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:04,916 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:04,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 18:40:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 18:40:05,120 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2024-11-22 18:40:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054218500] [2024-11-22 18:40:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-22 18:40:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054218500] [2024-11-22 18:40:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054218500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519191858] [2024-11-22 18:40:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:05,285 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:05,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 18:40:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:05,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:40:05,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:40:05,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:40:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519191858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:05,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-11-22 18:40:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480931469] [2024-11-22 18:40:05,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:40:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:40:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:40:05,478 INFO L87 Difference]: Start difference. First operand 2852 states and 3712 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:05,646 INFO L93 Difference]: Finished difference Result 2876 states and 3691 transitions. [2024-11-22 18:40:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:40:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-22 18:40:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:05,652 INFO L225 Difference]: With dead ends: 2876 [2024-11-22 18:40:05,652 INFO L226 Difference]: Without dead ends: 2876 [2024-11-22 18:40:05,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:40:05,653 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 171 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:05,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 743 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-11-22 18:40:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2134. [2024-11-22 18:40:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 2123 states have (on average 1.3028732925105981) internal successors, (2766), 2133 states have internal predecessors, (2766), 0 states have call successors, (0), 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-22 18:40:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2766 transitions. [2024-11-22 18:40:05,672 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2766 transitions. Word has length 65 [2024-11-22 18:40:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 2134 states and 2766 transitions. [2024-11-22 18:40:05,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2766 transitions. [2024-11-22 18:40:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 18:40:05,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:05,673 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:05,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:40:05,877 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2024-11-22 18:40:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:05,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741914151] [2024-11-22 18:40:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741914151] [2024-11-22 18:40:06,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741914151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580466565] [2024-11-22 18:40:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:06,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:06,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:06,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:06,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 18:40:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:06,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:40:06,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:06,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:06,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-22 18:40:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580466565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:06,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2024-11-22 18:40:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714229290] [2024-11-22 18:40:06,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:06,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:40:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:40:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:40:06,683 INFO L87 Difference]: Start difference. First operand 2134 states and 2766 transitions. Second operand has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 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-22 18:40:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:06,926 INFO L93 Difference]: Finished difference Result 3986 states and 5088 transitions. [2024-11-22 18:40:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:40:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-22 18:40:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:06,932 INFO L225 Difference]: With dead ends: 3986 [2024-11-22 18:40:06,932 INFO L226 Difference]: Without dead ends: 3986 [2024-11-22 18:40:06,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:40:06,933 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 843 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:06,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 385 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:40:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-22 18:40:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3100. [2024-11-22 18:40:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3089 states have (on average 1.3149886694723212) internal successors, (4062), 3099 states have internal predecessors, (4062), 0 states have call successors, (0), 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-22 18:40:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4062 transitions. [2024-11-22 18:40:06,963 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4062 transitions. Word has length 69 [2024-11-22 18:40:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4062 transitions. [2024-11-22 18:40:06,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 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-22 18:40:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4062 transitions. [2024-11-22 18:40:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 18:40:06,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:06,965 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 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-22 18:40:06,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-22 18:40:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:07,169 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2024-11-22 18:40:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393547763] [2024-11-22 18:40:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 18:40:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:40:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393547763] [2024-11-22 18:40:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393547763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:40:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955785859] [2024-11-22 18:40:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:07,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:07,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:40:07,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 18:40:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:07,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 18:40:07,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-22 18:40:07,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-22 18:40:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955785859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:07,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:40:07,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-11-22 18:40:07,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083769757] [2024-11-22 18:40:07,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:40:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:40:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:40:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:40:07,549 INFO L87 Difference]: Start difference. First operand 3100 states and 4062 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 18:40:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:07,716 INFO L93 Difference]: Finished difference Result 4895 states and 6112 transitions. [2024-11-22 18:40:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 18:40:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-22 18:40:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:07,723 INFO L225 Difference]: With dead ends: 4895 [2024-11-22 18:40:07,723 INFO L226 Difference]: Without dead ends: 4895 [2024-11-22 18:40:07,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:40:07,724 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 226 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:07,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1079 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2024-11-22 18:40:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4345. [2024-11-22 18:40:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4335 states have (on average 1.26320645905421) internal successors, (5476), 4344 states have internal predecessors, (5476), 0 states have call successors, (0), 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-22 18:40:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 5476 transitions. [2024-11-22 18:40:07,761 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 5476 transitions. Word has length 88 [2024-11-22 18:40:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:07,761 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 5476 transitions. [2024-11-22 18:40:07,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 18:40:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 5476 transitions. [2024-11-22 18:40:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 18:40:07,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:07,763 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 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, 1, 1] [2024-11-22 18:40:07,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-22 18:40:07,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:40:07,964 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:07,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1011471400, now seen corresponding path program 1 times [2024-11-22 18:40:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:40:07,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156381949] [2024-11-22 18:40:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:07,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:40:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:40:07,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:40:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:40:08,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:40:08,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:40:08,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-22 18:40:08,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-22 18:40:08,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-22 18:40:08,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-22 18:40:08,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-22 18:40:08,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 18:40:08,042 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:08,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:40:08,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:40:08 BoogieIcfgContainer [2024-11-22 18:40:08,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:40:08,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:40:08,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:40:08,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:40:08,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:39:54" (3/4) ... [2024-11-22 18:40:08,112 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 18:40:08,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:40:08,114 INFO L158 Benchmark]: Toolchain (without parser) took 14346.59ms. Allocated memory was 184.5MB in the beginning and 402.7MB in the end (delta: 218.1MB). Free memory was 113.3MB in the beginning and 234.0MB in the end (delta: -120.7MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,114 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:40:08,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.22ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 145.1MB in the end (delta: -32.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,114 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 184.5MB. Free memory was 143.0MB in the beginning and 140.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,114 INFO L158 Benchmark]: RCFGBuilder took 366.29ms. Allocated memory is still 184.5MB. Free memory was 140.0MB in the beginning and 120.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,115 INFO L158 Benchmark]: TraceAbstraction took 13476.45ms. Allocated memory was 184.5MB in the beginning and 402.7MB in the end (delta: 218.1MB). Free memory was 119.1MB in the beginning and 234.0MB in the end (delta: -114.9MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2024-11-22 18:40:08,115 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 402.7MB. Free memory is still 234.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:40:08,116 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.16ms. Allocated memory is still 184.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.22ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 145.1MB in the end (delta: -32.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 184.5MB. Free memory was 143.0MB in the beginning and 140.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.29ms. Allocated memory is still 184.5MB. Free memory was 140.0MB in the beginning and 120.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13476.45ms. Allocated memory was 184.5MB in the beginning and 402.7MB in the end (delta: 218.1MB). Free memory was 119.1MB in the beginning and 234.0MB in the end (delta: -114.9MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 402.7MB. Free memory is still 234.0MB. There was no memory consumed. 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 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=2, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=2, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=3, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=3, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L575] case 3: VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L576] EXPR t4->next VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L576] x4 = t4->next VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L575] case 3: [L578] case 4: [L580] S = x4 VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4704 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4704 mSDsluCounter, 10009 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7695 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2371 IncrementalHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 2314 mSDtfsCounter, 2371 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1711 GetRequests, 1407 SyntacticMatches, 14 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4623occurred in iteration=18, InterpolantAutomatonStates: 269, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 8555 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 6610 SizeOfPredicates, 57 NumberOfNonLiveVariables, 3253 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 2892/3753 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 18:40:08,132 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:40:10,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:40:10,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 18:40:10,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:40:10,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:40:10,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:40:10,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:40:10,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:40:10,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:40:10,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:40:10,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:40:10,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:40:10,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:40:10,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:40:10,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:40:10,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:40:10,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:40:10,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:40:10,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:40:10,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:40:10,500 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:40:10,501 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:40:10,501 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:40:10,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:40:10,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:40:10,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:40:10,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:40:10,504 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:40:10,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:40:10,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:40:10,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:40:10,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:40:10,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:40:10,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:40:10,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:40:10,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:40:10,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:40:10,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:40:10,506 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:40:10,507 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:40:10,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:40:10,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:40:10,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:40:10,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:40:10,508 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2024-11-22 18:40:10,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:40:10,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:40:10,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:40:10,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:40:10,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:40:10,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2024-11-22 18:40:12,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:40:12,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:40:12,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2024-11-22 18:40:12,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199e427ea/a39fdeab14474351a462ca1f3b58799c/FLAGd07d4293e [2024-11-22 18:40:12,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199e427ea/a39fdeab14474351a462ca1f3b58799c [2024-11-22 18:40:12,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:40:12,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:40:12,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:40:12,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:40:12,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:40:12,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:40:12" (1/1) ... [2024-11-22 18:40:12,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7bbc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:12, skipping insertion in model container [2024-11-22 18:40:12,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:40:12" (1/1) ... [2024-11-22 18:40:12,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:40:13,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:40:13,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:40:13,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:40:13,242 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:40:13,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13 WrapperNode [2024-11-22 18:40:13,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:40:13,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:40:13,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:40:13,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:40:13,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,278 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-22 18:40:13,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:40:13,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:40:13,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:40:13,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:40:13,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,300 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-22 18:40:13,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:40:13,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:40:13,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:40:13,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:40:13,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (1/1) ... [2024-11-22 18:40:13,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:40:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:40:13,364 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-22 18:40:13,367 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-22 18:40:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:40:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:40:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:40:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:40:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:40:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:40:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:40:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:40:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:40:13,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:40:13,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:40:13,991 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-22 18:40:13,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:40:14,003 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:40:14,004 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:40:14,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:40:14 BoogieIcfgContainer [2024-11-22 18:40:14,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:40:14,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:40:14,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:40:14,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:40:14,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:40:12" (1/3) ... [2024-11-22 18:40:14,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b994d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:40:14, skipping insertion in model container [2024-11-22 18:40:14,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:40:13" (2/3) ... [2024-11-22 18:40:14,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b994d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:40:14, skipping insertion in model container [2024-11-22 18:40:14,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:40:14" (3/3) ... [2024-11-22 18:40:14,012 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2024-11-22 18:40:14,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:40:14,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-22 18:40:14,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:40:14,097 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;@77dea025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:40:14,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-22 18:40:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 18:40:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:40:14,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:14,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:40:14,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:14,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-22 18:40:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709632501] [2024-11-22 18:40:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:14,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:14,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:14,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 18:40:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:14,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:40:14,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:14,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:14,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709632501] [2024-11-22 18:40:14,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709632501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:14,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:14,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:40:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80988091] [2024-11-22 18:40:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:14,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:40:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:40:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:40:14,220 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:14,231 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-22 18:40:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:40:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 18:40:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:14,238 INFO L225 Difference]: With dead ends: 64 [2024-11-22 18:40:14,239 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 18:40:14,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-22 18:40:14,242 INFO L432 NwaCegarLoop]: 81 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, 81 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-22 18:40:14,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 18:40:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-22 18:40:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-22 18:40:14,267 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-22 18:40:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:14,268 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-22 18:40:14,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-22 18:40:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:40:14,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:14,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:14,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:14,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:14,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-22 18:40:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97574157] [2024-11-22 18:40:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:14,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:14,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:14,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 18:40:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:14,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:40:14,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:14,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:14,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97574157] [2024-11-22 18:40:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97574157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:40:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756394322] [2024-11-22 18:40:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:40:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:40:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:40:14,615 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:14,669 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2024-11-22 18:40:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:40:14,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:40:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:14,671 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:40:14,671 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:40:14,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:40:14,672 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:14,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 209 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:40:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2024-11-22 18:40:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 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-22 18:40:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2024-11-22 18:40:14,678 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 7 [2024-11-22 18:40:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2024-11-22 18:40:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2024-11-22 18:40:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:40:14,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:14,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:14,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 18:40:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:14,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-22 18:40:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110473692] [2024-11-22 18:40:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:14,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:14,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:14,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:14,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 18:40:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:14,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:40:14,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:14,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:14,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110473692] [2024-11-22 18:40:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110473692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:40:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008520824] [2024-11-22 18:40:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:14,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:40:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:40:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:40:14,983 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:15,031 INFO L93 Difference]: Finished difference Result 147 states and 211 transitions. [2024-11-22 18:40:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:40:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:40:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:15,032 INFO L225 Difference]: With dead ends: 147 [2024-11-22 18:40:15,034 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 18:40:15,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-22 18:40:15,035 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:15,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 18:40:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2024-11-22 18:40:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.8571428571428572) internal successors, (195), 124 states have internal predecessors, (195), 0 states have call successors, (0), 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-22 18:40:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions. [2024-11-22 18:40:15,052 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 7 [2024-11-22 18:40:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 195 transitions. [2024-11-22 18:40:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2024-11-22 18:40:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:40:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:15,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:15,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 18:40:15,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:15,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:15,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-22 18:40:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549736728] [2024-11-22 18:40:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:15,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:15,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:15,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:15,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 18:40:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:15,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 18:40:15,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:15,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:15,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549736728] [2024-11-22 18:40:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549736728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:40:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747797735] [2024-11-22 18:40:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:40:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:40:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:40:15,330 INFO L87 Difference]: Start difference. First operand 125 states and 195 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:15,430 INFO L93 Difference]: Finished difference Result 205 states and 315 transitions. [2024-11-22 18:40:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:40:15,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:40:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:15,435 INFO L225 Difference]: With dead ends: 205 [2024-11-22 18:40:15,435 INFO L226 Difference]: Without dead ends: 202 [2024-11-22 18:40:15,435 INFO L431 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-22 18:40:15,436 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:15,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-22 18:40:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2024-11-22 18:40:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.8518518518518519) internal successors, (300), 181 states have internal predecessors, (300), 0 states have call successors, (0), 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-22 18:40:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 300 transitions. [2024-11-22 18:40:15,453 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 300 transitions. Word has length 8 [2024-11-22 18:40:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:15,454 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 300 transitions. [2024-11-22 18:40:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 300 transitions. [2024-11-22 18:40:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:40:15,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:15,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:15,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:15,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:15,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-22 18:40:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396853080] [2024-11-22 18:40:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:15,675 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 18:40:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:15,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:40:15,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:15,777 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 6 treesize of output 7 [2024-11-22 18:40:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:15,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:15,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396853080] [2024-11-22 18:40:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396853080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:40:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927165858] [2024-11-22 18:40:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:40:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:40:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:40:15,787 INFO L87 Difference]: Start difference. First operand 182 states and 300 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:15,907 INFO L93 Difference]: Finished difference Result 257 states and 407 transitions. [2024-11-22 18:40:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:40:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:40:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:15,909 INFO L225 Difference]: With dead ends: 257 [2024-11-22 18:40:15,909 INFO L226 Difference]: Without dead ends: 257 [2024-11-22 18:40:15,910 INFO L431 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-22 18:40:15,910 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:15,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-22 18:40:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 236. [2024-11-22 18:40:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.8027522935779816) internal successors, (393), 235 states have internal predecessors, (393), 0 states have call successors, (0), 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-22 18:40:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 393 transitions. [2024-11-22 18:40:15,925 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 393 transitions. Word has length 8 [2024-11-22 18:40:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:15,926 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 393 transitions. [2024-11-22 18:40:15,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 393 transitions. [2024-11-22 18:40:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:40:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:15,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:15,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 18:40:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-22 18:40:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930038600] [2024-11-22 18:40:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:16,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:16,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 18:40:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:16,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:40:16,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:16,182 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 6 treesize of output 5 [2024-11-22 18:40:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:16,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:16,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930038600] [2024-11-22 18:40:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930038600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:40:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368197552] [2024-11-22 18:40:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:40:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:40:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:40:16,192 INFO L87 Difference]: Start difference. First operand 236 states and 393 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:16,272 INFO L93 Difference]: Finished difference Result 252 states and 398 transitions. [2024-11-22 18:40:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:40:16,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 18:40:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:16,274 INFO L225 Difference]: With dead ends: 252 [2024-11-22 18:40:16,274 INFO L226 Difference]: Without dead ends: 252 [2024-11-22 18:40:16,274 INFO L431 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-22 18:40:16,274 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:16,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-22 18:40:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 234. [2024-11-22 18:40:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 1.7660550458715596) internal successors, (385), 233 states have internal predecessors, (385), 0 states have call successors, (0), 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-22 18:40:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 385 transitions. [2024-11-22 18:40:16,288 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 385 transitions. Word has length 8 [2024-11-22 18:40:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:16,290 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 385 transitions. [2024-11-22 18:40:16,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 385 transitions. [2024-11-22 18:40:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:40:16,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:16,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:16,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 18:40:16,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-22 18:40:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377360985] [2024-11-22 18:40:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:16,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:16,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 18:40:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:16,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:40:16,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:16,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:16,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377360985] [2024-11-22 18:40:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377360985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:16,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:40:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832142916] [2024-11-22 18:40:16,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:16,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:40:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:40:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:40:16,562 INFO L87 Difference]: Start difference. First operand 234 states and 385 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:16,586 INFO L93 Difference]: Finished difference Result 213 states and 323 transitions. [2024-11-22 18:40:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:40:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 18:40:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:16,588 INFO L225 Difference]: With dead ends: 213 [2024-11-22 18:40:16,588 INFO L226 Difference]: Without dead ends: 213 [2024-11-22 18:40:16,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-22 18:40:16,589 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:16,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-22 18:40:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 190. [2024-11-22 18:40:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 189 states have internal predecessors, (306), 0 states have call successors, (0), 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-22 18:40:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 306 transitions. [2024-11-22 18:40:16,604 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 306 transitions. Word has length 9 [2024-11-22 18:40:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:16,604 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 306 transitions. [2024-11-22 18:40:16,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 306 transitions. [2024-11-22 18:40:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:40:16,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:16,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:16,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-22 18:40:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477633071] [2024-11-22 18:40:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:16,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:16,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:16,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:40:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:16,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:40:16,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:16,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:40:16,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477633071] [2024-11-22 18:40:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477633071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:40:16,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:40:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:40:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671431106] [2024-11-22 18:40:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:40:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:40:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:40:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:40:16,873 INFO L87 Difference]: Start difference. First operand 190 states and 306 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:16,891 INFO L93 Difference]: Finished difference Result 284 states and 434 transitions. [2024-11-22 18:40:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:40:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 18:40:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:16,893 INFO L225 Difference]: With dead ends: 284 [2024-11-22 18:40:16,893 INFO L226 Difference]: Without dead ends: 284 [2024-11-22 18:40:16,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-22 18:40:16,893 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:16,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 192 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-22 18:40:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2024-11-22 18:40:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 256 states have (on average 1.6328125) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 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-22 18:40:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2024-11-22 18:40:16,898 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 10 [2024-11-22 18:40:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:16,898 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2024-11-22 18:40:16,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2024-11-22 18:40:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:40:16,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:16,899 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:16,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:17,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:17,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 20399352, now seen corresponding path program 1 times [2024-11-22 18:40:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711785558] [2024-11-22 18:40:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:17,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:17,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:17,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:17,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 18:40:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:17,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:40:17,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:17,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:17,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711785558] [2024-11-22 18:40:17,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711785558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:17,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-22 18:40:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473369648] [2024-11-22 18:40:17,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:40:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:40:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:40:17,218 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:40:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:17,298 INFO L93 Difference]: Finished difference Result 573 states and 833 transitions. [2024-11-22 18:40:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:40:17,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:40:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:17,300 INFO L225 Difference]: With dead ends: 573 [2024-11-22 18:40:17,300 INFO L226 Difference]: Without dead ends: 573 [2024-11-22 18:40:17,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:40:17,300 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 250 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:17,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 432 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-22 18:40:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 532. [2024-11-22 18:40:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 520 states have (on average 1.5692307692307692) internal successors, (816), 531 states have internal predecessors, (816), 0 states have call successors, (0), 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-22 18:40:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 816 transitions. [2024-11-22 18:40:17,311 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 816 transitions. Word has length 16 [2024-11-22 18:40:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:17,311 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 816 transitions. [2024-11-22 18:40:17,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:40:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 816 transitions. [2024-11-22 18:40:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:40:17,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:17,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:17,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 18:40:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:17,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1902356162, now seen corresponding path program 1 times [2024-11-22 18:40:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757955652] [2024-11-22 18:40:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:17,516 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:17,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 18:40:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:17,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:40:17,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:17,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:17,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757955652] [2024-11-22 18:40:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757955652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:17,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-22 18:40:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527545846] [2024-11-22 18:40:17,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:17,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:40:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:40:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:40:17,690 INFO L87 Difference]: Start difference. First operand 532 states and 816 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:17,773 INFO L93 Difference]: Finished difference Result 797 states and 1177 transitions. [2024-11-22 18:40:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:40:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:40:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:17,776 INFO L225 Difference]: With dead ends: 797 [2024-11-22 18:40:17,776 INFO L226 Difference]: Without dead ends: 797 [2024-11-22 18:40:17,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:40:17,776 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 81 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:17,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 440 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-22 18:40:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 723. [2024-11-22 18:40:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 711 states have (on average 1.5316455696202531) internal successors, (1089), 722 states have internal predecessors, (1089), 0 states have call successors, (0), 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-22 18:40:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1089 transitions. [2024-11-22 18:40:17,804 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1089 transitions. Word has length 16 [2024-11-22 18:40:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1089 transitions. [2024-11-22 18:40:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1089 transitions. [2024-11-22 18:40:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:40:17,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:17,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:17,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 18:40:18,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:18,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash 53823374, now seen corresponding path program 2 times [2024-11-22 18:40:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514474970] [2024-11-22 18:40:18,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:40:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:18,009 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:18,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 18:40:18,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:40:18,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:40:18,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:40:18,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514474970] [2024-11-22 18:40:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514474970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:18,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-22 18:40:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663466317] [2024-11-22 18:40:18,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:18,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:40:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:40:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:40:18,150 INFO L87 Difference]: Start difference. First operand 723 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:18,204 INFO L93 Difference]: Finished difference Result 1315 states and 1951 transitions. [2024-11-22 18:40:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:40:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 18:40:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:18,208 INFO L225 Difference]: With dead ends: 1315 [2024-11-22 18:40:18,208 INFO L226 Difference]: Without dead ends: 1315 [2024-11-22 18:40:18,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:40:18,208 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 216 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:18,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 507 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-22 18:40:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1217. [2024-11-22 18:40:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1205 states have (on average 1.5195020746887966) internal successors, (1831), 1216 states have internal predecessors, (1831), 0 states have call successors, (0), 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-22 18:40:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1831 transitions. [2024-11-22 18:40:18,237 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1831 transitions. Word has length 22 [2024-11-22 18:40:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:18,237 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1831 transitions. [2024-11-22 18:40:18,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1831 transitions. [2024-11-22 18:40:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:40:18,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:18,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:18,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:18,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:18,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2107196217, now seen corresponding path program 1 times [2024-11-22 18:40:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565967633] [2024-11-22 18:40:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:18,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:18,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 18:40:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:18,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:40:18,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:18,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565967633] [2024-11-22 18:40:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565967633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:18,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:18,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-22 18:40:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242264356] [2024-11-22 18:40:18,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:18,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:40:18,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:18,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:40:18,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:40:18,588 INFO L87 Difference]: Start difference. First operand 1217 states and 1831 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:18,638 INFO L93 Difference]: Finished difference Result 1427 states and 2074 transitions. [2024-11-22 18:40:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:40:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 18:40:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:18,642 INFO L225 Difference]: With dead ends: 1427 [2024-11-22 18:40:18,643 INFO L226 Difference]: Without dead ends: 1427 [2024-11-22 18:40:18,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:40:18,643 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:18,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 202 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-22 18:40:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1260. [2024-11-22 18:40:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1248 states have (on average 1.4791666666666667) internal successors, (1846), 1259 states have internal predecessors, (1846), 0 states have call successors, (0), 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-22 18:40:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1846 transitions. [2024-11-22 18:40:18,659 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1846 transitions. Word has length 24 [2024-11-22 18:40:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:18,659 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1846 transitions. [2024-11-22 18:40:18,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1846 transitions. [2024-11-22 18:40:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:40:18,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:18,660 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:18,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 18:40:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:18,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2024-11-22 18:40:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:18,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961646019] [2024-11-22 18:40:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:18,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:18,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:18,865 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 18:40:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:18,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:40:18,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:18,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:18,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961646019] [2024-11-22 18:40:18,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961646019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:18,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-22 18:40:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416121783] [2024-11-22 18:40:18,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:40:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:40:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:40:18,980 INFO L87 Difference]: Start difference. First operand 1260 states and 1846 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:40:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:19,028 INFO L93 Difference]: Finished difference Result 1209 states and 1705 transitions. [2024-11-22 18:40:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:40:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:40:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:19,032 INFO L225 Difference]: With dead ends: 1209 [2024-11-22 18:40:19,032 INFO L226 Difference]: Without dead ends: 1209 [2024-11-22 18:40:19,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:19,033 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:19,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 573 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-22 18:40:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1169. [2024-11-22 18:40:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1157 states have (on average 1.449438202247191) internal successors, (1677), 1168 states have internal predecessors, (1677), 0 states have call successors, (0), 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-22 18:40:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1677 transitions. [2024-11-22 18:40:19,047 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1677 transitions. Word has length 27 [2024-11-22 18:40:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:19,047 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1677 transitions. [2024-11-22 18:40:19,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 18:40:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1677 transitions. [2024-11-22 18:40:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 18:40:19,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:19,048 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:19,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:19,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:19,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:19,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1768537834, now seen corresponding path program 1 times [2024-11-22 18:40:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26920288] [2024-11-22 18:40:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:19,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:19,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:19,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 18:40:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:19,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:40:19,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:19,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:19,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26920288] [2024-11-22 18:40:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26920288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:19,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-22 18:40:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820148512] [2024-11-22 18:40:19,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:40:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:40:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:40:19,449 INFO L87 Difference]: Start difference. First operand 1169 states and 1677 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:19,516 INFO L93 Difference]: Finished difference Result 1124 states and 1549 transitions. [2024-11-22 18:40:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:40:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-22 18:40:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:19,519 INFO L225 Difference]: With dead ends: 1124 [2024-11-22 18:40:19,519 INFO L226 Difference]: Without dead ends: 1124 [2024-11-22 18:40:19,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:40:19,520 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 114 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:19,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 903 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-22 18:40:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1091. [2024-11-22 18:40:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1079 states have (on average 1.4216867469879517) internal successors, (1534), 1090 states have internal predecessors, (1534), 0 states have call successors, (0), 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-22 18:40:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1534 transitions. [2024-11-22 18:40:19,533 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1534 transitions. Word has length 35 [2024-11-22 18:40:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:19,534 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1534 transitions. [2024-11-22 18:40:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1534 transitions. [2024-11-22 18:40:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 18:40:19,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:19,535 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:19,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 18:40:19,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:19,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1819733348, now seen corresponding path program 1 times [2024-11-22 18:40:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951057582] [2024-11-22 18:40:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:19,743 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:19,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:40:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:19,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:40:19,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:40:19,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:40:20,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951057582] [2024-11-22 18:40:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951057582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:20,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 18:40:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853945860] [2024-11-22 18:40:20,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:40:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:40:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:40:20,011 INFO L87 Difference]: Start difference. First operand 1091 states and 1534 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:20,149 INFO L93 Difference]: Finished difference Result 1669 states and 2325 transitions. [2024-11-22 18:40:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:40:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-22 18:40:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:20,153 INFO L225 Difference]: With dead ends: 1669 [2024-11-22 18:40:20,153 INFO L226 Difference]: Without dead ends: 1669 [2024-11-22 18:40:20,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:40:20,154 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 359 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:20,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1039 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-22 18:40:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1588. [2024-11-22 18:40:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1576 states have (on average 1.4467005076142132) internal successors, (2280), 1587 states have internal predecessors, (2280), 0 states have call successors, (0), 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-22 18:40:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2280 transitions. [2024-11-22 18:40:20,189 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2280 transitions. Word has length 40 [2024-11-22 18:40:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:20,189 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2280 transitions. [2024-11-22 18:40:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2280 transitions. [2024-11-22 18:40:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 18:40:20,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:20,190 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:20,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 18:40:20,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:20,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:20,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -414991968, now seen corresponding path program 1 times [2024-11-22 18:40:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672444045] [2024-11-22 18:40:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:20,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:20,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:20,396 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:20,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 18:40:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:20,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:40:20,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:20,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:20,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672444045] [2024-11-22 18:40:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672444045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:20,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-22 18:40:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726954274] [2024-11-22 18:40:20,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:40:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:40:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:40:20,799 INFO L87 Difference]: Start difference. First operand 1588 states and 2280 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 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-22 18:40:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:21,032 INFO L93 Difference]: Finished difference Result 2260 states and 3140 transitions. [2024-11-22 18:40:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:40:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-22 18:40:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:21,039 INFO L225 Difference]: With dead ends: 2260 [2024-11-22 18:40:21,039 INFO L226 Difference]: Without dead ends: 2260 [2024-11-22 18:40:21,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:40:21,040 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 840 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:21,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1318 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2024-11-22 18:40:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2137. [2024-11-22 18:40:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2125 states have (on average 1.4423529411764706) internal successors, (3065), 2136 states have internal predecessors, (3065), 0 states have call successors, (0), 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-22 18:40:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3065 transitions. [2024-11-22 18:40:21,064 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3065 transitions. Word has length 40 [2024-11-22 18:40:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:21,064 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3065 transitions. [2024-11-22 18:40:21,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 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-22 18:40:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3065 transitions. [2024-11-22 18:40:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:40:21,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:21,065 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:21,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 18:40:21,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:21,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:21,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 576929085, now seen corresponding path program 1 times [2024-11-22 18:40:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789003730] [2024-11-22 18:40:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:21,270 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:21,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 18:40:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:21,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:40:21,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:21,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:21,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789003730] [2024-11-22 18:40:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789003730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:21,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 18:40:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139037986] [2024-11-22 18:40:21,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:21,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:40:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:40:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:40:21,518 INFO L87 Difference]: Start difference. First operand 2137 states and 3065 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:21,915 INFO L93 Difference]: Finished difference Result 2670 states and 3683 transitions. [2024-11-22 18:40:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 18:40:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-22 18:40:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:21,921 INFO L225 Difference]: With dead ends: 2670 [2024-11-22 18:40:21,921 INFO L226 Difference]: Without dead ends: 2670 [2024-11-22 18:40:21,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:40:21,922 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 987 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:21,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1436 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:40:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2024-11-22 18:40:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2595. [2024-11-22 18:40:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2583 states have (on average 1.4200542005420054) internal successors, (3668), 2594 states have internal predecessors, (3668), 0 states have call successors, (0), 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-22 18:40:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3668 transitions. [2024-11-22 18:40:21,949 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3668 transitions. Word has length 42 [2024-11-22 18:40:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3668 transitions. [2024-11-22 18:40:21,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3668 transitions. [2024-11-22 18:40:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 18:40:21,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:21,950 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 18:40:22,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:22,151 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -896397186, now seen corresponding path program 1 times [2024-11-22 18:40:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240652101] [2024-11-22 18:40:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:22,157 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 18:40:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:22,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:40:22,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:22,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:22,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240652101] [2024-11-22 18:40:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240652101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:22,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-22 18:40:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141078794] [2024-11-22 18:40:22,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:22,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:40:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:40:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:22,321 INFO L87 Difference]: Start difference. First operand 2595 states and 3668 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:22,395 INFO L93 Difference]: Finished difference Result 2582 states and 3579 transitions. [2024-11-22 18:40:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:40:22,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-22 18:40:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:22,401 INFO L225 Difference]: With dead ends: 2582 [2024-11-22 18:40:22,401 INFO L226 Difference]: Without dead ends: 2582 [2024-11-22 18:40:22,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:40:22,402 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 136 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:22,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1140 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2024-11-22 18:40:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2543. [2024-11-22 18:40:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2531 states have (on average 1.4081390754642433) internal successors, (3564), 2542 states have internal predecessors, (3564), 0 states have call successors, (0), 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-22 18:40:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3564 transitions. [2024-11-22 18:40:22,428 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3564 transitions. Word has length 43 [2024-11-22 18:40:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:22,428 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3564 transitions. [2024-11-22 18:40:22,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3564 transitions. [2024-11-22 18:40:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:40:22,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:22,429 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:22,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-22 18:40:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:22,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:22,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1836881493, now seen corresponding path program 1 times [2024-11-22 18:40:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011147729] [2024-11-22 18:40:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:22,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:22,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:22,633 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 18:40:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:22,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:40:22,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:22,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:40:22,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011147729] [2024-11-22 18:40:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011147729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:22,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-22 18:40:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401349585] [2024-11-22 18:40:22,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:40:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:40:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:40:22,825 INFO L87 Difference]: Start difference. First operand 2543 states and 3564 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:22,942 INFO L93 Difference]: Finished difference Result 2575 states and 3540 transitions. [2024-11-22 18:40:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:40:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-22 18:40:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:22,949 INFO L225 Difference]: With dead ends: 2575 [2024-11-22 18:40:22,949 INFO L226 Difference]: Without dead ends: 2575 [2024-11-22 18:40:22,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:40:22,950 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 168 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:22,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1571 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2024-11-22 18:40:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2517. [2024-11-22 18:40:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2505 states have (on average 1.401996007984032) internal successors, (3512), 2516 states have internal predecessors, (3512), 0 states have call successors, (0), 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-22 18:40:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3512 transitions. [2024-11-22 18:40:22,975 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3512 transitions. Word has length 53 [2024-11-22 18:40:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:22,975 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3512 transitions. [2024-11-22 18:40:22,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3512 transitions. [2024-11-22 18:40:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:40:22,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:22,976 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:22,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 18:40:23,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:23,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 2 times [2024-11-22 18:40:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086075660] [2024-11-22 18:40:23,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:40:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:23,183 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:23,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 18:40:23,253 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:40:23,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:40:23,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:40:23,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 58 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:40:23,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 58 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:40:23,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086075660] [2024-11-22 18:40:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086075660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:23,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2024-11-22 18:40:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804637067] [2024-11-22 18:40:23,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 18:40:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 18:40:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:40:23,701 INFO L87 Difference]: Start difference. First operand 2517 states and 3512 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 18:40:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:24,097 INFO L93 Difference]: Finished difference Result 2328 states and 3099 transitions. [2024-11-22 18:40:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 18:40:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-22 18:40:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:24,103 INFO L225 Difference]: With dead ends: 2328 [2024-11-22 18:40:24,103 INFO L226 Difference]: Without dead ends: 2328 [2024-11-22 18:40:24,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2024-11-22 18:40:24,104 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 972 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:24,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 2163 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:40:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2024-11-22 18:40:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2253. [2024-11-22 18:40:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2241 states have (on average 1.3761713520749665) internal successors, (3084), 2252 states have internal predecessors, (3084), 0 states have call successors, (0), 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-22 18:40:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3084 transitions. [2024-11-22 18:40:24,124 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3084 transitions. Word has length 63 [2024-11-22 18:40:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 2253 states and 3084 transitions. [2024-11-22 18:40:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 18:40:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3084 transitions. [2024-11-22 18:40:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 18:40:24,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:24,125 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:24,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 18:40:24,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:24,325 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2024-11-22 18:40:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:24,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867990872] [2024-11-22 18:40:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:24,328 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 18:40:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:24,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:40:24,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 18:40:24,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 18:40:24,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867990872] [2024-11-22 18:40:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867990872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:24,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:24,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-22 18:40:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869192471] [2024-11-22 18:40:24,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:24,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:40:24,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:40:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:40:24,596 INFO L87 Difference]: Start difference. First operand 2253 states and 3084 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:24,722 INFO L93 Difference]: Finished difference Result 4181 states and 5752 transitions. [2024-11-22 18:40:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:40:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-22 18:40:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:24,738 INFO L225 Difference]: With dead ends: 4181 [2024-11-22 18:40:24,739 INFO L226 Difference]: Without dead ends: 4181 [2024-11-22 18:40:24,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:24,740 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 116 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:24,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 246 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2024-11-22 18:40:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 3469. [2024-11-22 18:40:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3457 states have (on average 1.3844373734451836) internal successors, (4786), 3468 states have internal predecessors, (4786), 0 states have call successors, (0), 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-22 18:40:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4786 transitions. [2024-11-22 18:40:24,784 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4786 transitions. Word has length 64 [2024-11-22 18:40:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:24,784 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 4786 transitions. [2024-11-22 18:40:24,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4786 transitions. [2024-11-22 18:40:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 18:40:24,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:24,785 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:24,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-22 18:40:24,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:24,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:24,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207538, now seen corresponding path program 1 times [2024-11-22 18:40:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442958107] [2024-11-22 18:40:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:24,990 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:24,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-22 18:40:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:25,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:40:25,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:25,075 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 6 treesize of output 7 [2024-11-22 18:40:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:25,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:25,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442958107] [2024-11-22 18:40:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442958107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:25,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-22 18:40:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307262979] [2024-11-22 18:40:25,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:40:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:40:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:40:25,260 INFO L87 Difference]: Start difference. First operand 3469 states and 4786 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:25,509 INFO L93 Difference]: Finished difference Result 7106 states and 9725 transitions. [2024-11-22 18:40:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:40:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-22 18:40:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:25,519 INFO L225 Difference]: With dead ends: 7106 [2024-11-22 18:40:25,519 INFO L226 Difference]: Without dead ends: 7106 [2024-11-22 18:40:25,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:25,520 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 254 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:25,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 242 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:40:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2024-11-22 18:40:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 6446. [2024-11-22 18:40:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6435 states have (on average 1.3824397824397825) internal successors, (8896), 6445 states have internal predecessors, (8896), 0 states have call successors, (0), 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-22 18:40:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 8896 transitions. [2024-11-22 18:40:25,589 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 8896 transitions. Word has length 69 [2024-11-22 18:40:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 6446 states and 8896 transitions. [2024-11-22 18:40:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 8896 transitions. [2024-11-22 18:40:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 18:40:25,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:25,590 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:40:25,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-22 18:40:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:25,791 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:25,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2024-11-22 18:40:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:25,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439443747] [2024-11-22 18:40:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:25,796 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:25,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-22 18:40:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:25,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:40:25,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:25,880 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 6 treesize of output 5 [2024-11-22 18:40:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:26,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 18:40:26,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439443747] [2024-11-22 18:40:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439443747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:26,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-22 18:40:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200767725] [2024-11-22 18:40:26,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:40:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:40:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:40:26,405 INFO L87 Difference]: Start difference. First operand 6446 states and 8896 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-22 18:40:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:26,884 INFO L93 Difference]: Finished difference Result 10458 states and 14180 transitions. [2024-11-22 18:40:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:40:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-22 18:40:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:26,917 INFO L225 Difference]: With dead ends: 10458 [2024-11-22 18:40:26,918 INFO L226 Difference]: Without dead ends: 10458 [2024-11-22 18:40:26,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:40:26,918 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 382 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:26,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 408 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:40:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10458 states. [2024-11-22 18:40:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10458 to 9141. [2024-11-22 18:40:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9141 states, 9130 states have (on average 1.373274917853231) internal successors, (12538), 9140 states have internal predecessors, (12538), 0 states have call successors, (0), 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-22 18:40:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9141 states to 9141 states and 12538 transitions. [2024-11-22 18:40:27,003 INFO L78 Accepts]: Start accepts. Automaton has 9141 states and 12538 transitions. Word has length 69 [2024-11-22 18:40:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:27,003 INFO L471 AbstractCegarLoop]: Abstraction has 9141 states and 12538 transitions. [2024-11-22 18:40:27,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-22 18:40:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9141 states and 12538 transitions. [2024-11-22 18:40:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 18:40:27,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:27,007 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 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-22 18:40:27,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:27,210 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2024-11-22 18:40:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956281675] [2024-11-22 18:40:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:27,212 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:27,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-22 18:40:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:27,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:40:27,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-22 18:40:27,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-22 18:40:27,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956281675] [2024-11-22 18:40:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956281675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:27,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-22 18:40:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196392228] [2024-11-22 18:40:27,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:40:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:40:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:40:27,510 INFO L87 Difference]: Start difference. First operand 9141 states and 12538 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:27,587 INFO L93 Difference]: Finished difference Result 8698 states and 11781 transitions. [2024-11-22 18:40:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:40:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-22 18:40:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:27,599 INFO L225 Difference]: With dead ends: 8698 [2024-11-22 18:40:27,599 INFO L226 Difference]: Without dead ends: 8698 [2024-11-22 18:40:27,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:40:27,600 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 102 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:27,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 782 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:40:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8698 states. [2024-11-22 18:40:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8698 to 8607. [2024-11-22 18:40:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8607 states, 8596 states have (on average 1.3601675197766403) internal successors, (11692), 8606 states have internal predecessors, (11692), 0 states have call successors, (0), 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-22 18:40:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8607 states to 8607 states and 11692 transitions. [2024-11-22 18:40:27,679 INFO L78 Accepts]: Start accepts. Automaton has 8607 states and 11692 transitions. Word has length 88 [2024-11-22 18:40:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 8607 states and 11692 transitions. [2024-11-22 18:40:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:40:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8607 states and 11692 transitions. [2024-11-22 18:40:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 18:40:27,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:27,681 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 6, 5, 5, 5, 4, 4, 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] [2024-11-22 18:40:27,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-22 18:40:27,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:27,884 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:27,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1231542471, now seen corresponding path program 1 times [2024-11-22 18:40:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299945601] [2024-11-22 18:40:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:27,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:27,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:27,887 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-22 18:40:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:40:27,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:40:27,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:40:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 116 proven. 57 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-22 18:40:28,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:40:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 116 proven. 57 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-22 18:40:28,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:40:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299945601] [2024-11-22 18:40:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299945601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:40:28,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:40:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 18:40:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498236080] [2024-11-22 18:40:28,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:40:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:40:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:40:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:40:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:40:28,291 INFO L87 Difference]: Start difference. First operand 8607 states and 11692 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 18:40:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:40:28,447 INFO L93 Difference]: Finished difference Result 13274 states and 17791 transitions. [2024-11-22 18:40:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:40:28,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-22 18:40:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:40:28,471 INFO L225 Difference]: With dead ends: 13274 [2024-11-22 18:40:28,475 INFO L226 Difference]: Without dead ends: 13274 [2024-11-22 18:40:28,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:40:28,480 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 424 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:40:28,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 886 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:40:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13274 states. [2024-11-22 18:40:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13274 to 12865. [2024-11-22 18:40:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12865 states, 12854 states have (on average 1.3441730200715731) internal successors, (17278), 12864 states have internal predecessors, (17278), 0 states have call successors, (0), 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-22 18:40:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12865 states to 12865 states and 17278 transitions. [2024-11-22 18:40:28,645 INFO L78 Accepts]: Start accepts. Automaton has 12865 states and 17278 transitions. Word has length 93 [2024-11-22 18:40:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:40:28,645 INFO L471 AbstractCegarLoop]: Abstraction has 12865 states and 17278 transitions. [2024-11-22 18:40:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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-22 18:40:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 12865 states and 17278 transitions. [2024-11-22 18:40:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 18:40:28,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:40:28,650 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 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, 1, 1] [2024-11-22 18:40:28,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:28,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:28,852 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-22 18:40:28,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:40:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1011471400, now seen corresponding path program 1 times [2024-11-22 18:40:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:40:28,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885918437] [2024-11-22 18:40:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:40:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:28,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:40:28,854 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:40:28,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-22 18:40:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:40:29,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:40:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:40:29,150 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 18:40:29,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:40:29,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-22 18:40:29,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-22 18:40:29,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-22 18:40:29,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-22 18:40:29,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-22 18:40:29,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-22 18:40:29,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-22 18:40:29,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-22 18:40:29,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-22 18:40:29,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-22 18:40:29,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-22 18:40:29,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:40:29,357 INFO L407 BasicCegarLoop]: Path program histogram: [2, 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-22 18:40:29,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:40:29,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:40:29 BoogieIcfgContainer [2024-11-22 18:40:29,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:40:29,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:40:29,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:40:29,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:40:29,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:40:14" (3/4) ... [2024-11-22 18:40:29,446 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 18:40:29,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:40:29,447 INFO L158 Benchmark]: Toolchain (without parser) took 16633.94ms. Allocated memory was 88.1MB in the beginning and 241.2MB in the end (delta: 153.1MB). Free memory was 50.9MB in the beginning and 81.8MB in the end (delta: -30.9MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,447 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 52.4MB. Free memory is still 25.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:40:29,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.20ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 53.4MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.13ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,448 INFO L158 Benchmark]: Boogie Preprocessor took 51.87ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,448 INFO L158 Benchmark]: RCFGBuilder took 673.63ms. Allocated memory is still 88.1MB. Free memory was 48.2MB in the beginning and 54.1MB in the end (delta: -5.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,448 INFO L158 Benchmark]: TraceAbstraction took 15435.20ms. Allocated memory was 88.1MB in the beginning and 241.2MB in the end (delta: 153.1MB). Free memory was 53.1MB in the beginning and 81.8MB in the end (delta: -28.7MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-11-22 18:40:29,448 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 241.2MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:40:29,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 52.4MB. Free memory is still 25.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.20ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 53.4MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.13ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.87ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 673.63ms. Allocated memory is still 88.1MB. Free memory was 48.2MB in the beginning and 54.1MB in the end (delta: -5.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15435.20ms. Allocated memory was 88.1MB in the beginning and 241.2MB in the end (delta: 153.1MB). Free memory was 53.1MB in the beginning and 81.8MB in the end (delta: -28.7MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 241.2MB. Free memory is still 81.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={6:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=2, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=2, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=3, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=3, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L575] case 3: VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L576] EXPR t4->next VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L576] x4 = t4->next VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=4, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L575] case 3: [L578] case 4: [L580] S = x4 VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5960 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5960 mSDsluCounter, 15577 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12405 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 3172 mSDtfsCounter, 1871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1517 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12865occurred in iteration=25, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 4233 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1628 ConstructedInterpolants, 0 QuantifiedInterpolants, 7727 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2907 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 42 InterpolantComputations, 8 PerfectInterpolantSequences, 1666/2874 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 18:40:29,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample