./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:26:37,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:26:37,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:26:37,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:26:37,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:26:37,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:26:37,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:26:37,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:26:37,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:26:37,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:26:37,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:26:37,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:26:37,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:26:37,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:26:37,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:26:37,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:26:37,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:26:37,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:26:37,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:26:37,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:26:37,788 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:26:37,791 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:26:37,791 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:26:37,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:26:37,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:26:37,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:26:37,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:26:37,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:26:37,792 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:26:37,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:26:37,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:26:37,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:26:37,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:26:37,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:26:37,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:26:37,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:26:37,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:26:37,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:26:37,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:26:37,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:26:37,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:26:37,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:26:37,797 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2024-11-17 00:26:38,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:26:38,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:26:38,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:26:38,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:26:38,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:26:38,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-17 00:26:39,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:26:39,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:26:39,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-17 00:26:39,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db661e62/ae8fb7f3a39e4e21b0bb35a98567f51e/FLAG24f7076ea [2024-11-17 00:26:39,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db661e62/ae8fb7f3a39e4e21b0bb35a98567f51e [2024-11-17 00:26:39,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:26:39,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:26:39,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:26:39,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:26:39,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:26:39,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:26:39" (1/1) ... [2024-11-17 00:26:39,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c711e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:39, skipping insertion in model container [2024-11-17 00:26:39,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:26:39" (1/1) ... [2024-11-17 00:26:39,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:26:40,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:26:40,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:26:40,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:26:40,276 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:26:40,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40 WrapperNode [2024-11-17 00:26:40,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:26:40,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:26:40,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:26:40,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:26:40,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,336 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-17 00:26:40,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:26:40,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:26:40,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:26:40,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:26:40,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,380 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-17 00:26:40,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:26:40,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:26:40,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:26:40,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:26:40,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (1/1) ... [2024-11-17 00:26:40,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:26:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:40,446 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-17 00:26:40,449 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-17 00:26:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:26:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:26:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:26:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:26:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:26:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:26:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:26:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:26:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:26:40,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:26:40,614 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:26:40,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:26:40,988 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 00:26:40,988 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:26:41,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:26:41,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:26:41,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:41 BoogieIcfgContainer [2024-11-17 00:26:41,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:26:41,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:26:41,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:26:41,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:26:41,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:26:39" (1/3) ... [2024-11-17 00:26:41,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30577ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:26:41, skipping insertion in model container [2024-11-17 00:26:41,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:40" (2/3) ... [2024-11-17 00:26:41,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30577ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:26:41, skipping insertion in model container [2024-11-17 00:26:41,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:41" (3/3) ... [2024-11-17 00:26:41,013 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2024-11-17 00:26:41,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:26:41,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-17 00:26:41,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:26:41,075 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;@584cc8d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:26:41,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-17 00:26:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.851063829787234) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-17 00:26:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:26:41,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:41,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:26:41,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 52720286, now seen corresponding path program 1 times [2024-11-17 00:26:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:41,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828201011] [2024-11-17 00:26:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:41,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:41,265 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-17 00:26:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828201011] [2024-11-17 00:26:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828201011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:41,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490741960] [2024-11-17 00:26:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:26:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:26:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:26:41,306 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.851063829787234) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:41,325 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2024-11-17 00:26:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:26:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:26:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:41,335 INFO L225 Difference]: With dead ends: 68 [2024-11-17 00:26:41,335 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:26:41,337 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-17 00:26:41,340 INFO L432 NwaCegarLoop]: 85 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, 85 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-17 00:26:41,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:26:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:26:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-17 00:26:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2024-11-17 00:26:41,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 6 [2024-11-17 00:26:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:41,382 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-11-17 00:26:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-11-17 00:26:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:41,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:41,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:41,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:26:41,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -815439966, now seen corresponding path program 1 times [2024-11-17 00:26:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374543452] [2024-11-17 00:26:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:41,512 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-17 00:26:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:41,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374543452] [2024-11-17 00:26:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374543452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:41,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775261311] [2024-11-17 00:26:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:41,518 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:41,564 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2024-11-17 00:26:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:41,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:41,566 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:26:41,567 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:26:41,568 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-17 00:26:41,568 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:41,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:26:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-11-17 00:26:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-17 00:26:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-17 00:26:41,585 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2024-11-17 00:26:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:41,585 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-17 00:26:41,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-17 00:26:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:41,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:41,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:41,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:26:41,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -815334770, now seen corresponding path program 1 times [2024-11-17 00:26:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036596058] [2024-11-17 00:26:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:41,716 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-17 00:26:41,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:41,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036596058] [2024-11-17 00:26:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036596058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:41,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804040717] [2024-11-17 00:26:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:41,718 INFO L87 Difference]: Start difference. First operand 95 states and 139 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-17 00:26:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:41,804 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-11-17 00:26:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:41,804 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-17 00:26:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:41,806 INFO L225 Difference]: With dead ends: 173 [2024-11-17 00:26:41,806 INFO L226 Difference]: Without dead ends: 173 [2024-11-17 00:26:41,806 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-17 00:26:41,807 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 181 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-17 00:26:41,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-17 00:26:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2024-11-17 00:26:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.8091603053435115) internal successors, (237), 148 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-17 00:26:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 237 transitions. [2024-11-17 00:26:41,824 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 237 transitions. Word has length 8 [2024-11-17 00:26:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:41,825 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 237 transitions. [2024-11-17 00:26:41,825 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-17 00:26:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 237 transitions. [2024-11-17 00:26:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:41,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:41,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:41,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:26:41,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:41,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -815334769, now seen corresponding path program 1 times [2024-11-17 00:26:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249643383] [2024-11-17 00:26:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:41,985 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-17 00:26:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249643383] [2024-11-17 00:26:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249643383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:41,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646581268] [2024-11-17 00:26:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:41,988 INFO L87 Difference]: Start difference. First operand 149 states and 237 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-17 00:26:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:42,076 INFO L93 Difference]: Finished difference Result 225 states and 348 transitions. [2024-11-17 00:26:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:42,077 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-17 00:26:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:42,078 INFO L225 Difference]: With dead ends: 225 [2024-11-17 00:26:42,082 INFO L226 Difference]: Without dead ends: 225 [2024-11-17 00:26:42,082 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-17 00:26:42,083 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:42,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 190 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-17 00:26:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 203. [2024-11-17 00:26:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 187 states have (on average 1.7700534759358288) internal successors, (331), 202 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-17 00:26:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 331 transitions. [2024-11-17 00:26:42,100 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 331 transitions. Word has length 8 [2024-11-17 00:26:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 331 transitions. [2024-11-17 00:26:42,100 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-17 00:26:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 331 transitions. [2024-11-17 00:26:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:26:42,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:42,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:42,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:26:42,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:42,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash 494427598, now seen corresponding path program 1 times [2024-11-17 00:26:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389979144] [2024-11-17 00:26:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,187 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-17 00:26:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389979144] [2024-11-17 00:26:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389979144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:42,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:26:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596474120] [2024-11-17 00:26:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:26:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:26:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:26:42,190 INFO L87 Difference]: Start difference. First operand 203 states and 331 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:26:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:42,258 INFO L93 Difference]: Finished difference Result 378 states and 590 transitions. [2024-11-17 00:26:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:26:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:26:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:42,262 INFO L225 Difference]: With dead ends: 378 [2024-11-17 00:26:42,262 INFO L226 Difference]: Without dead ends: 378 [2024-11-17 00:26:42,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:26:42,265 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:42,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 267 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-17 00:26:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 347. [2024-11-17 00:26:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 331 states have (on average 1.7069486404833838) internal successors, (565), 346 states have internal predecessors, (565), 0 states have call successors, (0), 0 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-17 00:26:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2024-11-17 00:26:42,297 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 9 [2024-11-17 00:26:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:42,297 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2024-11-17 00:26:42,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 00:26:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2024-11-17 00:26:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:26:42,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:42,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:42,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:26:42,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1953799721, now seen corresponding path program 1 times [2024-11-17 00:26:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:42,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106324051] [2024-11-17 00:26:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,323 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-17 00:26:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106324051] [2024-11-17 00:26:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106324051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968949015] [2024-11-17 00:26:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:42,325 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-17 00:26:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:42,381 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2024-11-17 00:26:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-17 00:26:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:42,385 INFO L225 Difference]: With dead ends: 371 [2024-11-17 00:26:42,385 INFO L226 Difference]: Without dead ends: 366 [2024-11-17 00:26:42,385 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-17 00:26:42,386 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:42,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-17 00:26:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 349. [2024-11-17 00:26:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 333 states have (on average 1.6906906906906907) internal successors, (563), 348 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-17 00:26:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 563 transitions. [2024-11-17 00:26:42,408 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 563 transitions. Word has length 10 [2024-11-17 00:26:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:42,408 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 563 transitions. [2024-11-17 00:26:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-17 00:26:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 563 transitions. [2024-11-17 00:26:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:26:42,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:42,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:26:42,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1812525069, now seen corresponding path program 1 times [2024-11-17 00:26:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008000527] [2024-11-17 00:26:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,457 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-17 00:26:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008000527] [2024-11-17 00:26:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008000527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:26:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631483721] [2024-11-17 00:26:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:42,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:26:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:26:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:26:42,459 INFO L87 Difference]: Start difference. First operand 349 states and 563 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-17 00:26:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:42,509 INFO L93 Difference]: Finished difference Result 618 states and 932 transitions. [2024-11-17 00:26:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:26:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-17 00:26:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:42,512 INFO L225 Difference]: With dead ends: 618 [2024-11-17 00:26:42,512 INFO L226 Difference]: Without dead ends: 618 [2024-11-17 00:26:42,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:26:42,514 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:42,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 271 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-17 00:26:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 581. [2024-11-17 00:26:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 565 states have (on average 1.5911504424778762) internal successors, (899), 580 states have internal predecessors, (899), 0 states have call successors, (0), 0 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-17 00:26:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 899 transitions. [2024-11-17 00:26:42,531 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 899 transitions. Word has length 10 [2024-11-17 00:26:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 899 transitions. [2024-11-17 00:26:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-17 00:26:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 899 transitions. [2024-11-17 00:26:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:26:42,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:42,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:26:42,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1097754343, now seen corresponding path program 1 times [2024-11-17 00:26:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506900685] [2024-11-17 00:26:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:42,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506900685] [2024-11-17 00:26:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506900685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:42,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:26:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792159247] [2024-11-17 00:26:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:26:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:26:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:26:42,640 INFO L87 Difference]: Start difference. First operand 581 states and 899 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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-17 00:26:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:42,697 INFO L93 Difference]: Finished difference Result 931 states and 1443 transitions. [2024-11-17 00:26:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:26:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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-17 00:26:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:42,701 INFO L225 Difference]: With dead ends: 931 [2024-11-17 00:26:42,701 INFO L226 Difference]: Without dead ends: 931 [2024-11-17 00:26:42,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:26:42,704 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 51 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:42,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 340 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-17 00:26:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 889. [2024-11-17 00:26:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 873 states have (on average 1.5887743413516608) internal successors, (1387), 888 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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-17 00:26:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1387 transitions. [2024-11-17 00:26:42,724 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1387 transitions. Word has length 16 [2024-11-17 00:26:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1387 transitions. [2024-11-17 00:26:42,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-17 00:26:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1387 transitions. [2024-11-17 00:26:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:26:42,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:42,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:42,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:26:42,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:42,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1985258024, now seen corresponding path program 1 times [2024-11-17 00:26:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856691127] [2024-11-17 00:26:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:26:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856691127] [2024-11-17 00:26:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856691127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119833515] [2024-11-17 00:26:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:42,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:42,840 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-17 00:26:42,842 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-17 00:26:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:42,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:26:42,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:42,999 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-17 00:26:42,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:43,061 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-17 00:26:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119833515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:43,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:43,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-17 00:26:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975360523] [2024-11-17 00:26:43,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:43,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:26:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:26:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:26:43,063 INFO L87 Difference]: Start difference. First operand 889 states and 1387 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-17 00:26:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:43,178 INFO L93 Difference]: Finished difference Result 1495 states and 2221 transitions. [2024-11-17 00:26:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:26:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 00:26:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:43,184 INFO L225 Difference]: With dead ends: 1495 [2024-11-17 00:26:43,184 INFO L226 Difference]: Without dead ends: 1495 [2024-11-17 00:26:43,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:26:43,185 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 203 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:43,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 299 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-17 00:26:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1373. [2024-11-17 00:26:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1357 states have (on average 1.5350036845983788) internal successors, (2083), 1372 states have internal predecessors, (2083), 0 states have call successors, (0), 0 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-17 00:26:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2083 transitions. [2024-11-17 00:26:43,212 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2083 transitions. Word has length 16 [2024-11-17 00:26:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2083 transitions. [2024-11-17 00:26:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-17 00:26:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2083 transitions. [2024-11-17 00:26:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:26:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:43,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:43,231 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-17 00:26:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:43,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1546549153, now seen corresponding path program 1 times [2024-11-17 00:26:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050542913] [2024-11-17 00:26:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:43,490 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-17 00:26:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:43,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050542913] [2024-11-17 00:26:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050542913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453492996] [2024-11-17 00:26:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:43,493 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-17 00:26:43,494 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-17 00:26:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:43,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:26:43,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:43,593 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-17 00:26:43,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:43,622 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-17 00:26:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453492996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:43,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-17 00:26:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894704067] [2024-11-17 00:26:43,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:43,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:26:43,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:26:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:26:43,624 INFO L87 Difference]: Start difference. First operand 1373 states and 2083 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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-17 00:26:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:43,670 INFO L93 Difference]: Finished difference Result 1373 states and 2047 transitions. [2024-11-17 00:26:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:26:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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 18 [2024-11-17 00:26:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:43,675 INFO L225 Difference]: With dead ends: 1373 [2024-11-17 00:26:43,675 INFO L226 Difference]: Without dead ends: 1373 [2024-11-17 00:26:43,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:26:43,676 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 149 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:43,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 257 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-17 00:26:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1361. [2024-11-17 00:26:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1345 states have (on average 1.5174721189591078) internal successors, (2041), 1360 states have internal predecessors, (2041), 0 states have call successors, (0), 0 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-17 00:26:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2041 transitions. [2024-11-17 00:26:43,701 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2041 transitions. Word has length 18 [2024-11-17 00:26:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:43,702 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 2041 transitions. [2024-11-17 00:26:43,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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-17 00:26:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2041 transitions. [2024-11-17 00:26:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:26:43,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:43,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:43,723 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-17 00:26:43,908 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,SelfDestructingSolverStorable9 [2024-11-17 00:26:43,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2120661557, now seen corresponding path program 1 times [2024-11-17 00:26:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117107262] [2024-11-17 00:26:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:26:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117107262] [2024-11-17 00:26:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117107262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:26:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706069503] [2024-11-17 00:26:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:26:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:26:43,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:26:43,972 INFO L87 Difference]: Start difference. First operand 1361 states and 2041 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:44,007 INFO L93 Difference]: Finished difference Result 582 states and 841 transitions. [2024-11-17 00:26:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:26:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:26:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:44,010 INFO L225 Difference]: With dead ends: 582 [2024-11-17 00:26:44,010 INFO L226 Difference]: Without dead ends: 582 [2024-11-17 00:26:44,010 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-17 00:26:44,011 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 178 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-17 00:26:44,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 178 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-17 00:26:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2024-11-17 00:26:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 554 states have (on average 1.5) internal successors, (831), 565 states have internal predecessors, (831), 0 states have call successors, (0), 0 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-17 00:26:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 831 transitions. [2024-11-17 00:26:44,023 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 831 transitions. Word has length 21 [2024-11-17 00:26:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:44,024 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 831 transitions. [2024-11-17 00:26:44,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 831 transitions. [2024-11-17 00:26:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:26:44,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:44,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:26:44,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:44,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1680763932, now seen corresponding path program 1 times [2024-11-17 00:26:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331826899] [2024-11-17 00:26:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:44,120 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-17 00:26:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331826899] [2024-11-17 00:26:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331826899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184118426] [2024-11-17 00:26:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:44,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:44,123 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-17 00:26:44,125 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-17 00:26:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:44,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:26:44,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:44,270 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-17 00:26:44,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:44,327 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-17 00:26:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184118426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:44,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-17 00:26:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366829092] [2024-11-17 00:26:44,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:44,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:26:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:26:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:26:44,329 INFO L87 Difference]: Start difference. First operand 566 states and 831 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-17 00:26:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:44,407 INFO L93 Difference]: Finished difference Result 1664 states and 2419 transitions. [2024-11-17 00:26:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:26:44,407 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-17 00:26:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:44,413 INFO L225 Difference]: With dead ends: 1664 [2024-11-17 00:26:44,413 INFO L226 Difference]: Without dead ends: 1664 [2024-11-17 00:26:44,413 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-17 00:26:44,413 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 184 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:44,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 166 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-17 00:26:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1604. [2024-11-17 00:26:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1592 states have (on average 1.4880653266331658) internal successors, (2369), 1603 states have internal predecessors, (2369), 0 states have call successors, (0), 0 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-17 00:26:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2369 transitions. [2024-11-17 00:26:44,440 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2369 transitions. Word has length 24 [2024-11-17 00:26:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:44,442 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2369 transitions. [2024-11-17 00:26:44,442 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-17 00:26:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2369 transitions. [2024-11-17 00:26:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:26:44,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:44,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:44,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:26:44,644 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-17 00:26:44,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:44,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1209208832, now seen corresponding path program 1 times [2024-11-17 00:26:44,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:44,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442329952] [2024-11-17 00:26:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:26:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442329952] [2024-11-17 00:26:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442329952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249569971] [2024-11-17 00:26:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:44,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:44,764 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-17 00:26:44,766 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-17 00:26:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:44,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:26:44,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:44,883 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-17 00:26:44,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:44,910 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-17 00:26:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249569971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:44,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-17 00:26:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087002352] [2024-11-17 00:26:44,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:26:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:26:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:26:44,914 INFO L87 Difference]: Start difference. First operand 1604 states and 2369 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-17 00:26:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:45,007 INFO L93 Difference]: Finished difference Result 416 states and 579 transitions. [2024-11-17 00:26:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:26:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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 27 [2024-11-17 00:26:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:45,010 INFO L225 Difference]: With dead ends: 416 [2024-11-17 00:26:45,010 INFO L226 Difference]: Without dead ends: 416 [2024-11-17 00:26:45,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:26:45,011 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:45,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 432 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-17 00:26:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 341. [2024-11-17 00:26:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 329 states have (on average 1.452887537993921) internal successors, (478), 340 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-17 00:26:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 478 transitions. [2024-11-17 00:26:45,018 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 478 transitions. Word has length 27 [2024-11-17 00:26:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:45,019 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 478 transitions. [2024-11-17 00:26:45,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-17 00:26:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 478 transitions. [2024-11-17 00:26:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:26:45,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:45,020 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, 1, 1] [2024-11-17 00:26:45,037 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-17 00:26:45,221 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-17 00:26:45,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 564875401, now seen corresponding path program 1 times [2024-11-17 00:26:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105071409] [2024-11-17 00:26:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:45,319 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-17 00:26:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105071409] [2024-11-17 00:26:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105071409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461752819] [2024-11-17 00:26:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:45,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:45,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:45,322 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-17 00:26:45,324 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-17 00:26:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:45,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:26:45,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:45,437 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-17 00:26:45,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:45,497 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-17 00:26:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461752819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:45,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-17 00:26:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409972617] [2024-11-17 00:26:45,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:45,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:26:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:26:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:26:45,500 INFO L87 Difference]: Start difference. First operand 341 states and 478 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-17 00:26:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:45,631 INFO L93 Difference]: Finished difference Result 986 states and 1330 transitions. [2024-11-17 00:26:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:26:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 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 29 [2024-11-17 00:26:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:45,634 INFO L225 Difference]: With dead ends: 986 [2024-11-17 00:26:45,634 INFO L226 Difference]: Without dead ends: 986 [2024-11-17 00:26:45,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:26:45,636 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 224 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:45,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 579 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-17 00:26:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 881. [2024-11-17 00:26:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.42692750287687) internal successors, (1240), 880 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-17 00:26:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1240 transitions. [2024-11-17 00:26:45,653 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1240 transitions. Word has length 29 [2024-11-17 00:26:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:45,654 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1240 transitions. [2024-11-17 00:26:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-17 00:26:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1240 transitions. [2024-11-17 00:26:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:26:45,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:45,656 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2024-11-17 00:26:45,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:26:45,856 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-17 00:26:45,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1328968864, now seen corresponding path program 1 times [2024-11-17 00:26:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446864848] [2024-11-17 00:26:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:26:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446864848] [2024-11-17 00:26:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446864848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597807357] [2024-11-17 00:26:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:45,979 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-17 00:26:45,980 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-17 00:26:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:46,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:26:46,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:26:46,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:26:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597807357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:46,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2024-11-17 00:26:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954200958] [2024-11-17 00:26:46,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:26:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:46,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:26:46,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:26:46,234 INFO L87 Difference]: Start difference. First operand 881 states and 1240 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-17 00:26:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:47,761 INFO L93 Difference]: Finished difference Result 2678 states and 3579 transitions. [2024-11-17 00:26:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-17 00:26:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 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-17 00:26:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:47,768 INFO L225 Difference]: With dead ends: 2678 [2024-11-17 00:26:47,769 INFO L226 Difference]: Without dead ends: 2678 [2024-11-17 00:26:47,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=881, Invalid=3675, Unknown=0, NotChecked=0, Total=4556 [2024-11-17 00:26:47,771 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 660 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:47,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1040 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:26:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2024-11-17 00:26:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2056. [2024-11-17 00:26:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2045 states have (on average 1.425916870415648) internal successors, (2916), 2055 states have internal predecessors, (2916), 0 states have call successors, (0), 0 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-17 00:26:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2916 transitions. [2024-11-17 00:26:47,821 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2916 transitions. Word has length 51 [2024-11-17 00:26:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2916 transitions. [2024-11-17 00:26:47,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-17 00:26:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2916 transitions. [2024-11-17 00:26:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:26:47,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:47,823 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, 1, 1] [2024-11-17 00:26:47,841 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-17 00:26:48,027 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-17 00:26:48,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash -329277618, now seen corresponding path program 1 times [2024-11-17 00:26:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824880304] [2024-11-17 00:26:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:48,169 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-17 00:26:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824880304] [2024-11-17 00:26:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824880304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437373964] [2024-11-17 00:26:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:48,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:48,172 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-17 00:26:48,174 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-17 00:26:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:48,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:26:48,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:48,387 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-17 00:26:48,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:48,496 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-17 00:26:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437373964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:48,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2024-11-17 00:26:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829034422] [2024-11-17 00:26:48,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:26:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:26:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:26:48,498 INFO L87 Difference]: Start difference. First operand 2056 states and 2916 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-17 00:26:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:48,783 INFO L93 Difference]: Finished difference Result 3946 states and 5571 transitions. [2024-11-17 00:26:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 00:26:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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-17 00:26:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:48,798 INFO L225 Difference]: With dead ends: 3946 [2024-11-17 00:26:48,799 INFO L226 Difference]: Without dead ends: 3946 [2024-11-17 00:26:48,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2024-11-17 00:26:48,800 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 374 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:48,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 726 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2024-11-17 00:26:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3124. [2024-11-17 00:26:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3113 states have (on average 1.4734982332155477) internal successors, (4587), 3123 states have internal predecessors, (4587), 0 states have call successors, (0), 0 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-17 00:26:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4587 transitions. [2024-11-17 00:26:48,853 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4587 transitions. Word has length 53 [2024-11-17 00:26:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:48,853 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4587 transitions. [2024-11-17 00:26:48,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-17 00:26:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4587 transitions. [2024-11-17 00:26:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-17 00:26:48,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:48,855 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, 1, 1] [2024-11-17 00:26:48,872 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-17 00:26:49,055 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-17 00:26:49,056 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 69116688, now seen corresponding path program 1 times [2024-11-17 00:26:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995875175] [2024-11-17 00:26:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:49,211 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-17 00:26:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995875175] [2024-11-17 00:26:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995875175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765515028] [2024-11-17 00:26:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:49,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:49,215 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-17 00:26:49,217 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-17 00:26:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:49,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:26:49,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:49,398 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-17 00:26:49,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:49,451 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-17 00:26:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765515028] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:49,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:26:49,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2024-11-17 00:26:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960563502] [2024-11-17 00:26:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:49,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:26:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:26:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:26:49,454 INFO L87 Difference]: Start difference. First operand 3124 states and 4587 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:49,557 INFO L93 Difference]: Finished difference Result 5182 states and 7470 transitions. [2024-11-17 00:26:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:26:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-17 00:26:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:49,573 INFO L225 Difference]: With dead ends: 5182 [2024-11-17 00:26:49,573 INFO L226 Difference]: Without dead ends: 5182 [2024-11-17 00:26:49,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 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-17 00:26:49,574 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:49,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 357 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2024-11-17 00:26:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5051. [2024-11-17 00:26:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 5040 states have (on average 1.457142857142857) internal successors, (7344), 5050 states have internal predecessors, (7344), 0 states have call successors, (0), 0 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-17 00:26:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 7344 transitions. [2024-11-17 00:26:49,653 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 7344 transitions. Word has length 61 [2024-11-17 00:26:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:49,654 INFO L471 AbstractCegarLoop]: Abstraction has 5051 states and 7344 transitions. [2024-11-17 00:26:49,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 7344 transitions. [2024-11-17 00:26:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:26:49,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:49,656 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-17 00:26:49,673 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-17 00:26:49,856 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-17 00:26:49,857 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:49,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:49,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1839106254, now seen corresponding path program 1 times [2024-11-17 00:26:49,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:49,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026060461] [2024-11-17 00:26:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:50,069 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-17 00:26:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:26:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026060461] [2024-11-17 00:26:50,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026060461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:26:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049825400] [2024-11-17 00:26:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:50,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:26:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:50,073 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-17 00:26:50,074 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-17 00:26:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:50,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:26:50,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:50,271 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-17 00:26:50,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:26:50,342 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-17 00:26:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049825400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:26:50,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:26:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-17 00:26:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249277164] [2024-11-17 00:26:50,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:26:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:26:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:26:50,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:26:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:26:50,345 INFO L87 Difference]: Start difference. First operand 5051 states and 7344 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-17 00:26:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:50,837 INFO L93 Difference]: Finished difference Result 8797 states and 12478 transitions. [2024-11-17 00:26:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-17 00:26:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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-17 00:26:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:50,863 INFO L225 Difference]: With dead ends: 8797 [2024-11-17 00:26:50,863 INFO L226 Difference]: Without dead ends: 8797 [2024-11-17 00:26:50,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2024-11-17 00:26:50,864 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 241 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:50,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1125 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:26:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8797 states. [2024-11-17 00:26:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8797 to 5207. [2024-11-17 00:26:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5207 states, 5196 states have (on average 1.4420708237105466) internal successors, (7493), 5206 states have internal predecessors, (7493), 0 states have call successors, (0), 0 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-17 00:26:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5207 states to 5207 states and 7493 transitions. [2024-11-17 00:26:51,012 INFO L78 Accepts]: Start accepts. Automaton has 5207 states and 7493 transitions. Word has length 65 [2024-11-17 00:26:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 5207 states and 7493 transitions. [2024-11-17 00:26:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-17 00:26:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5207 states and 7493 transitions. [2024-11-17 00:26:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 00:26:51,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:51,016 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, 1, 1] [2024-11-17 00:26:51,033 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-17 00:26:51,219 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-17 00:26:51,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:51,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1542751695, now seen corresponding path program 1 times [2024-11-17 00:26:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:26:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295396975] [2024-11-17 00:26:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:26:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:26:51,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:26:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:26:51,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:26:51,303 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:26:51,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-17 00:26:51,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 20 remaining) [2024-11-17 00:26:51,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 20 remaining) [2024-11-17 00:26:51,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-17 00:26:51,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-17 00:26:51,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-17 00:26:51,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-17 00:26:51,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-17 00:26:51,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-17 00:26:51,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-17 00:26:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-17 00:26:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-17 00:26:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2024-11-17 00:26:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2024-11-17 00:26:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2024-11-17 00:26:51,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:26:51,313 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:51,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:26:51,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:26:51 BoogieIcfgContainer [2024-11-17 00:26:51,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:26:51,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:26:51,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:26:51,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:26:51,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:41" (3/4) ... [2024-11-17 00:26:51,399 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 00:26:51,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:26:51,401 INFO L158 Benchmark]: Toolchain (without parser) took 11661.35ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 89.0MB in the beginning and 133.4MB in the end (delta: -44.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,401 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:26:51,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 161.5MB. Free memory was 89.0MB in the beginning and 68.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.31ms. Allocated memory is still 161.5MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,401 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 161.5MB. Free memory was 66.7MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,402 INFO L158 Benchmark]: IcfgBuilder took 600.41ms. Allocated memory is still 161.5MB. Free memory was 64.4MB in the beginning and 118.4MB in the end (delta: -54.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,402 INFO L158 Benchmark]: TraceAbstraction took 10387.59ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 117.7MB in the beginning and 134.4MB in the end (delta: -16.8MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-17 00:26:51,402 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 234.9MB. Free memory was 134.4MB in the beginning and 133.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:26:51,403 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.15ms. Allocated memory is still 119.5MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 161.5MB. Free memory was 89.0MB in the beginning and 68.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.31ms. Allocated memory is still 161.5MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 161.5MB. Free memory was 66.7MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 600.41ms. Allocated memory is still 161.5MB. Free memory was 64.4MB in the beginning and 118.4MB in the end (delta: -54.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10387.59ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 117.7MB in the beginning and 134.4MB in the end (delta: -16.8MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 234.9MB. Free memory was 134.4MB in the beginning and 133.4MB in the end (delta: 1.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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __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 FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) 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}] [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=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2634 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2634 mSDsluCounter, 6762 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5041 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2120 IncrementalHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1721 mSDtfsCounter, 2120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 915 GetRequests, 691 SyntacticMatches, 13 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5207occurred in iteration=18, InterpolantAutomatonStates: 214, 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, 18 MinimizatonAttempts, 5746 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 2509 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1670 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 1117/1400 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-17 00:26:51,433 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:26:53,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:26:53,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 00:26:53,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:26:53,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:26:53,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:26:53,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:26:53,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:26:53,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:26:53,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:26:53,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:26:53,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:26:53,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:26:53,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:26:53,740 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:26:53,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:26:53,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:26:53,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:26:53,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:26:53,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:26:53,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:26:53,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:26:53,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:26:53,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:26:53,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:26:53,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:26:53,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:26:53,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:26:53,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:26:53,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:26:53,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:26:53,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:26:53,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:26:53,746 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:26:53,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:26:53,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:26:53,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:26:53,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:26:53,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:26:53,748 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2024-11-17 00:26:54,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:26:54,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:26:54,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:26:54,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:26:54,117 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:26:54,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-17 00:26:55,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:26:55,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:26:55,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-17 00:26:55,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4571aa96/072ec3c1438e44eb9d97945a30010048/FLAGcf42d70e6 [2024-11-17 00:26:55,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4571aa96/072ec3c1438e44eb9d97945a30010048 [2024-11-17 00:26:55,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:26:55,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:26:55,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:26:55,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:26:55,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:26:55,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:26:55" (1/1) ... [2024-11-17 00:26:55,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796e2f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:55, skipping insertion in model container [2024-11-17 00:26:55,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:26:55" (1/1) ... [2024-11-17 00:26:56,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:26:56,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:26:56,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:26:56,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:26:56,488 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:26:56,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56 WrapperNode [2024-11-17 00:26:56,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:26:56,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:26:56,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:26:56,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:26:56,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,548 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2024-11-17 00:26:56,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:26:56,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:26:56,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:26:56,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:26:56,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,610 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-17 00:26:56,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:26:56,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:26:56,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:26:56,644 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:26:56,645 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (1/1) ... [2024-11-17 00:26:56,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:26:56,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:26:56,680 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-17 00:26:56,683 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-17 00:26:56,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:26:56,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:26:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:26:56,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:26:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:26:56,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:26:56,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:26:56,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:26:56,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:26:56,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:26:56,849 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:26:56,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:26:57,241 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 00:26:57,241 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:26:57,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:26:57,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:26:57,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:57 BoogieIcfgContainer [2024-11-17 00:26:57,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:26:57,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:26:57,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:26:57,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:26:57,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:26:55" (1/3) ... [2024-11-17 00:26:57,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f0c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:26:57, skipping insertion in model container [2024-11-17 00:26:57,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:26:56" (2/3) ... [2024-11-17 00:26:57,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f0c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:26:57, skipping insertion in model container [2024-11-17 00:26:57,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:57" (3/3) ... [2024-11-17 00:26:57,265 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2024-11-17 00:26:57,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:26:57,279 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-17 00:26:57,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:26:57,326 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;@6ab3405f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:26:57,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-17 00:26:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.851063829787234) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-17 00:26:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:26:57,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:57,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:26:57,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:57,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 52720286, now seen corresponding path program 1 times [2024-11-17 00:26:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588898102] [2024-11-17 00:26:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:57,362 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-17 00:26:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:57,365 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-17 00:26:57,366 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-17 00:26:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:57,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:26:57,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:57,479 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-17 00:26:57,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:57,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588898102] [2024-11-17 00:26:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588898102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755642053] [2024-11-17 00:26:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:57,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:26:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:57,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:26:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:26:57,518 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.851063829787234) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:57,536 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2024-11-17 00:26:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:26:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:26:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:57,546 INFO L225 Difference]: With dead ends: 68 [2024-11-17 00:26:57,546 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:26:57,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-17 00:26:57,552 INFO L432 NwaCegarLoop]: 85 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, 85 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-17 00:26:57,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:26:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:26:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-17 00:26:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2024-11-17 00:26:57,587 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 6 [2024-11-17 00:26:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:57,587 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-11-17 00:26:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:26:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-11-17 00:26:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:57,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:57,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:57,591 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 (2)] Ended with exit code 0 [2024-11-17 00:26:57,790 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-17 00:26:57,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:57,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash -815439966, now seen corresponding path program 1 times [2024-11-17 00:26:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:57,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583462956] [2024-11-17 00:26:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:57,792 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-17 00:26:57,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:57,798 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-17 00:26:57,799 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-17 00:26:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:57,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:26:57,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:57,969 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-17 00:26:57,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:57,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583462956] [2024-11-17 00:26:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583462956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:57,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100731222] [2024-11-17 00:26:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:57,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:57,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:57,972 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:58,037 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2024-11-17 00:26:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:58,039 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:26:58,039 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:26:58,040 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-17 00:26:58,041 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:58,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:26:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-11-17 00:26:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-17 00:26:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-17 00:26:58,053 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2024-11-17 00:26:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:58,054 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-17 00:26:58,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 00:26:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-17 00:26:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:58,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:58,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:58,060 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-17 00:26:58,255 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-17 00:26:58,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -815334770, now seen corresponding path program 1 times [2024-11-17 00:26:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600185008] [2024-11-17 00:26:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:58,257 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-17 00:26:58,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:58,260 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-17 00:26:58,261 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-17 00:26:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:58,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:26:58,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:58,382 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-17 00:26:58,399 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-17 00:26:58,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:58,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600185008] [2024-11-17 00:26:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600185008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:58,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57300693] [2024-11-17 00:26:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:58,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:58,402 INFO L87 Difference]: Start difference. First operand 95 states and 139 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-17 00:26:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:58,621 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-11-17 00:26:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:58,621 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-17 00:26:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:58,622 INFO L225 Difference]: With dead ends: 173 [2024-11-17 00:26:58,623 INFO L226 Difference]: Without dead ends: 173 [2024-11-17 00:26:58,623 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-17 00:26:58,624 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 181 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.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:58,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:26:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-17 00:26:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2024-11-17 00:26:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.8091603053435115) internal successors, (237), 148 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-17 00:26:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 237 transitions. [2024-11-17 00:26:58,637 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 237 transitions. Word has length 8 [2024-11-17 00:26:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:58,638 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 237 transitions. [2024-11-17 00:26:58,638 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-17 00:26:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 237 transitions. [2024-11-17 00:26:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:26:58,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:58,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:58,643 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-17 00:26:58,841 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-17 00:26:58,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash -815334769, now seen corresponding path program 1 times [2024-11-17 00:26:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324278676] [2024-11-17 00:26:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:58,843 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-17 00:26:58,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:58,846 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-17 00:26:58,848 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-17 00:26:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:58,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:26:58,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:58,912 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-17 00:26:58,921 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-17 00:26:58,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:58,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324278676] [2024-11-17 00:26:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324278676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275877463] [2024-11-17 00:26:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:58,923 INFO L87 Difference]: Start difference. First operand 149 states and 237 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-17 00:26:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:59,031 INFO L93 Difference]: Finished difference Result 225 states and 348 transitions. [2024-11-17 00:26:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:59,032 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-17 00:26:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:59,034 INFO L225 Difference]: With dead ends: 225 [2024-11-17 00:26:59,034 INFO L226 Difference]: Without dead ends: 225 [2024-11-17 00:26:59,034 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-17 00:26:59,035 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:59,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 190 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-17 00:26:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 203. [2024-11-17 00:26:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 187 states have (on average 1.7700534759358288) internal successors, (331), 202 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-17 00:26:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 331 transitions. [2024-11-17 00:26:59,057 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 331 transitions. Word has length 8 [2024-11-17 00:26:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:59,057 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 331 transitions. [2024-11-17 00:26:59,058 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-17 00:26:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 331 transitions. [2024-11-17 00:26:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:26:59,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:59,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:59,066 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-17 00:26:59,262 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-17 00:26:59,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:59,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash 494427598, now seen corresponding path program 1 times [2024-11-17 00:26:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011843664] [2024-11-17 00:26:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:59,264 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-17 00:26:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:59,267 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-17 00:26:59,269 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-17 00:26:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:59,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:26:59,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:59,338 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-17 00:26:59,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:59,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011843664] [2024-11-17 00:26:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011843664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:26:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669343962] [2024-11-17 00:26:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:59,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:26:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:26:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:26:59,340 INFO L87 Difference]: Start difference. First operand 203 states and 331 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-17 00:26:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:59,381 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2024-11-17 00:26:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:26:59,383 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-17 00:26:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:59,384 INFO L225 Difference]: With dead ends: 186 [2024-11-17 00:26:59,384 INFO L226 Difference]: Without dead ends: 186 [2024-11-17 00:26:59,384 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-17 00:26:59,385 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 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-17 00:26:59,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:26:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-17 00:26:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 125. [2024-11-17 00:26:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 113 states have (on average 1.6725663716814159) internal successors, (189), 124 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-17 00:26:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2024-11-17 00:26:59,396 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 189 transitions. Word has length 9 [2024-11-17 00:26:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:59,396 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 189 transitions. [2024-11-17 00:26:59,396 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-17 00:26:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 189 transitions. [2024-11-17 00:26:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:26:59,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:59,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:59,401 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-17 00:26:59,597 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-17 00:26:59,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1953799721, now seen corresponding path program 1 times [2024-11-17 00:26:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592287300] [2024-11-17 00:26:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:59,599 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-17 00:26:59,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:59,601 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-17 00:26:59,602 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-17 00:26:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:26:59,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:26:59,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:26:59,678 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-17 00:26:59,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:26:59,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:26:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592287300] [2024-11-17 00:26:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592287300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:26:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:26:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:26:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694360468] [2024-11-17 00:26:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:26:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:26:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:26:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:26:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:26:59,685 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-17 00:26:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:26:59,777 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2024-11-17 00:26:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:26:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-17 00:26:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:26:59,778 INFO L225 Difference]: With dead ends: 185 [2024-11-17 00:26:59,778 INFO L226 Difference]: Without dead ends: 180 [2024-11-17 00:26:59,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-17 00:26:59,779 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:26:59,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 117 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:26:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-17 00:26:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 161. [2024-11-17 00:26:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 149 states have (on average 1.691275167785235) internal successors, (252), 160 states have internal predecessors, (252), 0 states have call successors, (0), 0 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-17 00:26:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 252 transitions. [2024-11-17 00:26:59,792 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 252 transitions. Word has length 10 [2024-11-17 00:26:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:26:59,793 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 252 transitions. [2024-11-17 00:26:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-17 00:26:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 252 transitions. [2024-11-17 00:26:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:26:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:26:59,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:26:59,808 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 (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:26:59,994 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-17 00:26:59,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:26:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:26:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1812525069, now seen corresponding path program 1 times [2024-11-17 00:26:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:26:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727993299] [2024-11-17 00:26:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:26:59,995 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-17 00:26:59,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:26:59,998 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-17 00:26:59,999 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-17 00:27:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:00,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:27:00,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:00,071 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-17 00:27:00,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:27:00,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:00,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727993299] [2024-11-17 00:27:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727993299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:27:00,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:27:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:27:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766036567] [2024-11-17 00:27:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:27:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:27:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:00,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:27:00,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:27:00,074 INFO L87 Difference]: Start difference. First operand 161 states and 252 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-17 00:27:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:00,101 INFO L93 Difference]: Finished difference Result 248 states and 370 transitions. [2024-11-17 00:27:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:27:00,102 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-17 00:27:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:00,103 INFO L225 Difference]: With dead ends: 248 [2024-11-17 00:27:00,103 INFO L226 Difference]: Without dead ends: 248 [2024-11-17 00:27:00,103 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-17 00:27:00,104 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:00,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:27:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-17 00:27:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 227. [2024-11-17 00:27:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 215 states have (on average 1.6232558139534883) internal successors, (349), 226 states have internal predecessors, (349), 0 states have call successors, (0), 0 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-17 00:27:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 349 transitions. [2024-11-17 00:27:00,111 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 349 transitions. Word has length 10 [2024-11-17 00:27:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:00,111 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 349 transitions. [2024-11-17 00:27:00,111 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-17 00:27:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 349 transitions. [2024-11-17 00:27:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:27:00,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:00,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:00,116 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 (8)] Ended with exit code 0 [2024-11-17 00:27:00,315 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-17 00:27:00,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:00,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1097754343, now seen corresponding path program 1 times [2024-11-17 00:27:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667957015] [2024-11-17 00:27:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:00,317 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-17 00:27:00,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:00,320 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-17 00:27:00,320 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-17 00:27:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:00,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:27:00,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:27:00,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:27:00,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667957015] [2024-11-17 00:27:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667957015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:00,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-17 00:27:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310392786] [2024-11-17 00:27:00,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:27:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:27:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:27:00,463 INFO L87 Difference]: Start difference. First operand 227 states and 349 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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-17 00:27:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:00,566 INFO L93 Difference]: Finished difference Result 596 states and 898 transitions. [2024-11-17 00:27:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:27:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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-17 00:27:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:00,568 INFO L225 Difference]: With dead ends: 596 [2024-11-17 00:27:00,569 INFO L226 Difference]: Without dead ends: 596 [2024-11-17 00:27:00,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:27:00,570 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 209 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:00,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 471 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-17 00:27:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 537. [2024-11-17 00:27:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 525 states have (on average 1.5752380952380953) internal successors, (827), 536 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-17 00:27:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 827 transitions. [2024-11-17 00:27:00,582 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 827 transitions. Word has length 16 [2024-11-17 00:27:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:00,582 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 827 transitions. [2024-11-17 00:27:00,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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-17 00:27:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 827 transitions. [2024-11-17 00:27:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:27:00,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:00,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:00,587 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 (9)] Ended with exit code 0 [2024-11-17 00:27:00,785 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-17 00:27:00,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:00,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1985258024, now seen corresponding path program 1 times [2024-11-17 00:27:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510492106] [2024-11-17 00:27:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:00,787 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-17 00:27:00,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:00,789 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-17 00:27:00,790 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-17 00:27:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:00,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:27:00,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:00,894 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-17 00:27:00,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:00,928 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-17 00:27:00,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510492106] [2024-11-17 00:27:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510492106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:00,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-17 00:27:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044003960] [2024-11-17 00:27:00,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:27:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:27:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:27:00,930 INFO L87 Difference]: Start difference. First operand 537 states and 827 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-17 00:27:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:01,008 INFO L93 Difference]: Finished difference Result 522 states and 770 transitions. [2024-11-17 00:27:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:27:01,008 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-17 00:27:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:01,010 INFO L225 Difference]: With dead ends: 522 [2024-11-17 00:27:01,010 INFO L226 Difference]: Without dead ends: 522 [2024-11-17 00:27:01,010 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-17 00:27:01,011 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 68 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:01,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 399 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:27:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-17 00:27:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 495. [2024-11-17 00:27:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 483 states have (on average 1.5383022774327122) internal successors, (743), 494 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-17 00:27:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 743 transitions. [2024-11-17 00:27:01,026 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 743 transitions. Word has length 16 [2024-11-17 00:27:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:01,026 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 743 transitions. [2024-11-17 00:27:01,026 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-17 00:27:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 743 transitions. [2024-11-17 00:27:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:27:01,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:01,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:01,031 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-17 00:27:01,227 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-17 00:27:01,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1546549153, now seen corresponding path program 1 times [2024-11-17 00:27:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965959624] [2024-11-17 00:27:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:01,229 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-17 00:27:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:01,230 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-17 00:27:01,231 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-17 00:27:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:01,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:27:01,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:01,327 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-17 00:27:01,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:01,370 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-17 00:27:01,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965959624] [2024-11-17 00:27:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965959624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:01,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-17 00:27:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078463784] [2024-11-17 00:27:01,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:01,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:27:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:27:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:27:01,373 INFO L87 Difference]: Start difference. First operand 495 states and 743 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:01,461 INFO L93 Difference]: Finished difference Result 1136 states and 1662 transitions. [2024-11-17 00:27:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:27:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 18 [2024-11-17 00:27:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:01,466 INFO L225 Difference]: With dead ends: 1136 [2024-11-17 00:27:01,466 INFO L226 Difference]: Without dead ends: 1136 [2024-11-17 00:27:01,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:27:01,467 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 286 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:01,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 447 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:27:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-17 00:27:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1091. [2024-11-17 00:27:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1079 states have (on average 1.520852641334569) internal successors, (1641), 1090 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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-17 00:27:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1641 transitions. [2024-11-17 00:27:01,502 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1641 transitions. Word has length 18 [2024-11-17 00:27:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:01,502 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1641 transitions. [2024-11-17 00:27:01,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1641 transitions. [2024-11-17 00:27:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:27:01,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:01,504 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:01,508 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 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:27:01,706 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-17 00:27:01,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:01,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1603864419, now seen corresponding path program 2 times [2024-11-17 00:27:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924105737] [2024-11-17 00:27:01,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:27:01,708 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-17 00:27:01,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:01,709 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-17 00:27:01,710 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-17 00:27:01,759 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:27:01,759 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:27:01,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:27:01,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:01,824 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-17 00:27:01,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:01,873 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-17 00:27:01,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:01,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924105737] [2024-11-17 00:27:01,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924105737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:01,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:01,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-17 00:27:01,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237079134] [2024-11-17 00:27:01,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:01,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:27:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:01,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:27:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:27:01,877 INFO L87 Difference]: Start difference. First operand 1091 states and 1641 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:02,031 INFO L93 Difference]: Finished difference Result 1530 states and 2211 transitions. [2024-11-17 00:27:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:27:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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-17 00:27:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:02,036 INFO L225 Difference]: With dead ends: 1530 [2024-11-17 00:27:02,036 INFO L226 Difference]: Without dead ends: 1530 [2024-11-17 00:27:02,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:27:02,037 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 87 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:02,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 691 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-17 00:27:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1452. [2024-11-17 00:27:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1440 states have (on average 1.4729166666666667) internal successors, (2121), 1451 states have internal predecessors, (2121), 0 states have call successors, (0), 0 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-17 00:27:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2121 transitions. [2024-11-17 00:27:02,063 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2121 transitions. Word has length 22 [2024-11-17 00:27:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:02,063 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2121 transitions. [2024-11-17 00:27:02,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2121 transitions. [2024-11-17 00:27:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:27:02,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:02,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:02,069 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-17 00:27:02,269 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-17 00:27:02,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1680763932, now seen corresponding path program 1 times [2024-11-17 00:27:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662822033] [2024-11-17 00:27:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:02,270 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-17 00:27:02,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:02,271 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-17 00:27:02,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 (13)] Waiting until timeout for monitored process [2024-11-17 00:27:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:02,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:27:02,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:02,422 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-17 00:27:02,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:02,494 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-17 00:27:02,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662822033] [2024-11-17 00:27:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662822033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:02,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-17 00:27:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206590854] [2024-11-17 00:27:02,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:02,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:27:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:27:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:27:02,496 INFO L87 Difference]: Start difference. First operand 1452 states and 2121 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-17 00:27:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:02,568 INFO L93 Difference]: Finished difference Result 1739 states and 2487 transitions. [2024-11-17 00:27:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:27:02,569 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-17 00:27:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:02,574 INFO L225 Difference]: With dead ends: 1739 [2024-11-17 00:27:02,574 INFO L226 Difference]: Without dead ends: 1739 [2024-11-17 00:27:02,574 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-17 00:27:02,575 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:02,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 213 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2024-11-17 00:27:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1568. [2024-11-17 00:27:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1556 states have (on average 1.449228791773779) internal successors, (2255), 1567 states have internal predecessors, (2255), 0 states have call successors, (0), 0 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-17 00:27:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2255 transitions. [2024-11-17 00:27:02,602 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2255 transitions. Word has length 24 [2024-11-17 00:27:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2255 transitions. [2024-11-17 00:27:02,603 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-17 00:27:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2255 transitions. [2024-11-17 00:27:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:27:02,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:02,604 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, 1, 1] [2024-11-17 00:27:02,608 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 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:27:02,805 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-17 00:27:02,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:02,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 564875401, now seen corresponding path program 1 times [2024-11-17 00:27:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975168434] [2024-11-17 00:27:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:02,806 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-17 00:27:02,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:02,807 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-17 00:27:02,813 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-17 00:27:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:02,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:27:02,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:02,928 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-17 00:27:02,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:02,962 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-17 00:27:02,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975168434] [2024-11-17 00:27:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975168434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:02,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-17 00:27:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352058312] [2024-11-17 00:27:02,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:27:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:27:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:27:02,964 INFO L87 Difference]: Start difference. First operand 1568 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:03,034 INFO L93 Difference]: Finished difference Result 1497 states and 2070 transitions. [2024-11-17 00:27:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:27:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-17 00:27:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:03,039 INFO L225 Difference]: With dead ends: 1497 [2024-11-17 00:27:03,040 INFO L226 Difference]: Without dead ends: 1497 [2024-11-17 00:27:03,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 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-17 00:27:03,042 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 84 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 591 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-17 00:27:03,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 591 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:27:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2024-11-17 00:27:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1449. [2024-11-17 00:27:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1437 states have (on average 1.4154488517745303) internal successors, (2034), 1448 states have internal predecessors, (2034), 0 states have call successors, (0), 0 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-17 00:27:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2034 transitions. [2024-11-17 00:27:03,077 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2034 transitions. Word has length 29 [2024-11-17 00:27:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:03,077 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2034 transitions. [2024-11-17 00:27:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-17 00:27:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2034 transitions. [2024-11-17 00:27:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:27:03,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:03,078 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, 1, 1] [2024-11-17 00:27:03,082 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 (14)] Ended with exit code 0 [2024-11-17 00:27:03,279 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-17 00:27:03,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:03,279 INFO L85 PathProgramCache]: Analyzing trace with hash -642234592, now seen corresponding path program 1 times [2024-11-17 00:27:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578354406] [2024-11-17 00:27:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:03,280 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-17 00:27:03,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:03,281 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-17 00:27:03,282 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-17 00:27:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:03,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:27:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:03,416 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-17 00:27:03,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:03,459 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-17 00:27:03,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578354406] [2024-11-17 00:27:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578354406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:03,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-17 00:27:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255084445] [2024-11-17 00:27:03,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:03,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:27:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:27:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:27:03,461 INFO L87 Difference]: Start difference. First operand 1449 states and 2034 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:03,547 INFO L93 Difference]: Finished difference Result 1384 states and 1866 transitions. [2024-11-17 00:27:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:27:03,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 00:27:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:03,552 INFO L225 Difference]: With dead ends: 1384 [2024-11-17 00:27:03,552 INFO L226 Difference]: Without dead ends: 1384 [2024-11-17 00:27:03,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 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-17 00:27:03,553 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 117 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 936 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:03,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 936 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-17 00:27:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1347. [2024-11-17 00:27:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1335 states have (on average 1.3835205992509363) internal successors, (1847), 1346 states have internal predecessors, (1847), 0 states have call successors, (0), 0 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-17 00:27:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1847 transitions. [2024-11-17 00:27:03,574 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1847 transitions. Word has length 37 [2024-11-17 00:27:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:03,574 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1847 transitions. [2024-11-17 00:27:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1847 transitions. [2024-11-17 00:27:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:27:03,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:03,576 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:27:03,579 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 (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:27:03,776 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-17 00:27:03,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:03,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash 360165884, now seen corresponding path program 1 times [2024-11-17 00:27:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:03,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292877872] [2024-11-17 00:27:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:03,778 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-17 00:27:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:03,779 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-17 00:27:03,780 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-17 00:27:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:03,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:27:03,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:03,947 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-17 00:27:03,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:04,137 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-17 00:27:04,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:04,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292877872] [2024-11-17 00:27:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292877872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:04,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-17 00:27:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067761715] [2024-11-17 00:27:04,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:04,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:27:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:27:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:27:04,139 INFO L87 Difference]: Start difference. First operand 1347 states and 1847 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-17 00:27:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:04,318 INFO L93 Difference]: Finished difference Result 2049 states and 2782 transitions. [2024-11-17 00:27:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:27:04,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-17 00:27:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:04,326 INFO L225 Difference]: With dead ends: 2049 [2024-11-17 00:27:04,326 INFO L226 Difference]: Without dead ends: 2049 [2024-11-17 00:27:04,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 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-17 00:27:04,327 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 478 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:04,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 759 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-17 00:27:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1956. [2024-11-17 00:27:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1944 states have (on average 1.4017489711934157) internal successors, (2725), 1955 states have internal predecessors, (2725), 0 states have call successors, (0), 0 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-17 00:27:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2725 transitions. [2024-11-17 00:27:04,361 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2725 transitions. Word has length 42 [2024-11-17 00:27:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:04,361 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2725 transitions. [2024-11-17 00:27:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-17 00:27:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2725 transitions. [2024-11-17 00:27:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:27:04,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:04,362 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, 1, 1] [2024-11-17 00:27:04,367 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-17 00:27:04,563 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-17 00:27:04,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1045248714, now seen corresponding path program 1 times [2024-11-17 00:27:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146387480] [2024-11-17 00:27:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:04,564 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-17 00:27:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:04,565 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-17 00:27:04,566 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-17 00:27:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:04,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:27:04,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:04,747 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-17 00:27:04,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:05,034 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-17 00:27:05,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146387480] [2024-11-17 00:27:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146387480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:05,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-17 00:27:05,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797531019] [2024-11-17 00:27:05,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:05,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:27:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:05,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:27:05,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:27:05,036 INFO L87 Difference]: Start difference. First operand 1956 states and 2725 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-17 00:27:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:05,391 INFO L93 Difference]: Finished difference Result 2776 states and 3749 transitions. [2024-11-17 00:27:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:27:05,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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-17 00:27:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:05,400 INFO L225 Difference]: With dead ends: 2776 [2024-11-17 00:27:05,400 INFO L226 Difference]: Without dead ends: 2776 [2024-11-17 00:27:05,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:27:05,401 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 815 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:05,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1855 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:27:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2024-11-17 00:27:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2633. [2024-11-17 00:27:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2621 states have (on average 1.3941243800076306) internal successors, (3654), 2632 states have internal predecessors, (3654), 0 states have call successors, (0), 0 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-17 00:27:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3654 transitions. [2024-11-17 00:27:05,443 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3654 transitions. Word has length 42 [2024-11-17 00:27:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3654 transitions. [2024-11-17 00:27:05,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-17 00:27:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3654 transitions. [2024-11-17 00:27:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:27:05,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:05,444 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, 1] [2024-11-17 00:27:05,448 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-17 00:27:05,647 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-17 00:27:05,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1739428373, now seen corresponding path program 1 times [2024-11-17 00:27:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306930179] [2024-11-17 00:27:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:05,649 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-17 00:27:05,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:05,652 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-17 00:27:05,653 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-17 00:27:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:05,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:27:05,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:05,841 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-17 00:27:05,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:05,949 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-17 00:27:05,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306930179] [2024-11-17 00:27:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306930179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:05,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 00:27:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580629097] [2024-11-17 00:27:05,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:27:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:27:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:27:05,952 INFO L87 Difference]: Start difference. First operand 2633 states and 3654 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-17 00:27:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:06,263 INFO L93 Difference]: Finished difference Result 3331 states and 4545 transitions. [2024-11-17 00:27:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:27:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 44 [2024-11-17 00:27:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:06,274 INFO L225 Difference]: With dead ends: 3331 [2024-11-17 00:27:06,274 INFO L226 Difference]: Without dead ends: 3331 [2024-11-17 00:27:06,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:27:06,275 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 912 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:06,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1414 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2024-11-17 00:27:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3251. [2024-11-17 00:27:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 3239 states have (on average 1.3970361222599568) internal successors, (4525), 3250 states have internal predecessors, (4525), 0 states have call successors, (0), 0 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-17 00:27:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4525 transitions. [2024-11-17 00:27:06,343 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4525 transitions. Word has length 44 [2024-11-17 00:27:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 4525 transitions. [2024-11-17 00:27:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-17 00:27:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4525 transitions. [2024-11-17 00:27:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-17 00:27:06,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:06,345 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, 1, 1] [2024-11-17 00:27:06,349 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 (18)] Forceful destruction successful, exit code 0 [2024-11-17 00:27:06,545 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-17 00:27:06,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:06,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:06,546 INFO L85 PathProgramCache]: Analyzing trace with hash -891592592, now seen corresponding path program 1 times [2024-11-17 00:27:06,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:06,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585845385] [2024-11-17 00:27:06,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:06,547 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-17 00:27:06,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:06,550 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-17 00:27:06,551 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-17 00:27:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:06,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:27:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:06,719 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-17 00:27:06,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:06,772 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-17 00:27:06,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585845385] [2024-11-17 00:27:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585845385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:06,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-17 00:27:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264031776] [2024-11-17 00:27:06,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:06,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:27:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:27:06,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:27:06,777 INFO L87 Difference]: Start difference. First operand 3251 states and 4525 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:06,875 INFO L93 Difference]: Finished difference Result 3226 states and 4408 transitions. [2024-11-17 00:27:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:27:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-17 00:27:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:06,884 INFO L225 Difference]: With dead ends: 3226 [2024-11-17 00:27:06,884 INFO L226 Difference]: Without dead ends: 3226 [2024-11-17 00:27:06,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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-17 00:27:06,885 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 139 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1161 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-17 00:27:06,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1161 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2024-11-17 00:27:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3183. [2024-11-17 00:27:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 3171 states have (on average 1.3841059602649006) internal successors, (4389), 3182 states have internal predecessors, (4389), 0 states have call successors, (0), 0 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-17 00:27:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4389 transitions. [2024-11-17 00:27:06,977 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4389 transitions. Word has length 45 [2024-11-17 00:27:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:06,979 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 4389 transitions. [2024-11-17 00:27:06,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4389 transitions. [2024-11-17 00:27:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:27:06,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:06,980 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, 1, 1] [2024-11-17 00:27:06,984 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 (19)] Forceful destruction successful, exit code 0 [2024-11-17 00:27:07,183 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-17 00:27:07,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash -269785089, now seen corresponding path program 1 times [2024-11-17 00:27:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572418077] [2024-11-17 00:27:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:07,185 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-17 00:27:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:07,188 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-17 00:27:07,189 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-17 00:27:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:27:07,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:27:07,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:07,394 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-17 00:27:07,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:07,460 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-17 00:27:07,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572418077] [2024-11-17 00:27:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572418077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:07,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-17 00:27:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443064737] [2024-11-17 00:27:07,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:27:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:27:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:27:07,463 INFO L87 Difference]: Start difference. First operand 3183 states and 4389 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:07,610 INFO L93 Difference]: Finished difference Result 3215 states and 4357 transitions. [2024-11-17 00:27:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:27:07,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-17 00:27:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:07,619 INFO L225 Difference]: With dead ends: 3215 [2024-11-17 00:27:07,620 INFO L226 Difference]: Without dead ends: 3215 [2024-11-17 00:27:07,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:27:07,621 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 171 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1595 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-17 00:27:07,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1595 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:27:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2024-11-17 00:27:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3149. [2024-11-17 00:27:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3137 states have (on average 1.3774306662416322) internal successors, (4321), 3148 states have internal predecessors, (4321), 0 states have call successors, (0), 0 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-17 00:27:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4321 transitions. [2024-11-17 00:27:07,684 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4321 transitions. Word has length 55 [2024-11-17 00:27:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:07,685 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4321 transitions. [2024-11-17 00:27:07,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:27:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4321 transitions. [2024-11-17 00:27:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:27:07,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:07,686 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-17 00:27:07,691 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-17 00:27:07,887 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-17 00:27:07,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1839106254, now seen corresponding path program 2 times [2024-11-17 00:27:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392255052] [2024-11-17 00:27:07,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:27:07,888 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-17 00:27:07,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:07,889 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-17 00:27:07,892 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-17 00:27:07,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:27:07,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:27:08,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:27:08,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:27:08,107 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-17 00:27:08,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:27:08,589 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-17 00:27:08,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:27:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392255052] [2024-11-17 00:27:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392255052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:27:08,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:27:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2024-11-17 00:27:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953273618] [2024-11-17 00:27:08,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:27:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 00:27:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:27:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 00:27:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:27:08,592 INFO L87 Difference]: Start difference. First operand 3149 states and 4321 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-17 00:27:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:27:09,039 INFO L93 Difference]: Finished difference Result 2950 states and 3870 transitions. [2024-11-17 00:27:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:27:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 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-17 00:27:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:27:09,047 INFO L225 Difference]: With dead ends: 2950 [2024-11-17 00:27:09,047 INFO L226 Difference]: Without dead ends: 2950 [2024-11-17 00:27:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:27:09,048 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 896 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:27:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 2232 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:27:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2024-11-17 00:27:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2871. [2024-11-17 00:27:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2859 states have (on average 1.346974466596712) internal successors, (3851), 2870 states have internal predecessors, (3851), 0 states have call successors, (0), 0 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-17 00:27:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3851 transitions. [2024-11-17 00:27:09,106 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3851 transitions. Word has length 65 [2024-11-17 00:27:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:27:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3851 transitions. [2024-11-17 00:27:09,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-17 00:27:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3851 transitions. [2024-11-17 00:27:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 00:27:09,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:27:09,108 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, 1, 1] [2024-11-17 00:27:09,113 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-17 00:27:09,308 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-17 00:27:09,309 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2024-11-17 00:27:09,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:27:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1542751695, now seen corresponding path program 1 times [2024-11-17 00:27:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:27:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602990795] [2024-11-17 00:27:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:27:09,310 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-17 00:27:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:27:09,313 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-17 00:27:09,314 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-17 00:27:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:27:09,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:27:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:27:09,525 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 00:27:09,525 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:27:09,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-17 00:27:09,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 20 remaining) [2024-11-17 00:27:09,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 20 remaining) [2024-11-17 00:27:09,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 20 remaining) [2024-11-17 00:27:09,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-17 00:27:09,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-17 00:27:09,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-17 00:27:09,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-17 00:27:09,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-17 00:27:09,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-17 00:27:09,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-17 00:27:09,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-17 00:27:09,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-17 00:27:09,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-17 00:27:09,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-17 00:27:09,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-17 00:27:09,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-17 00:27:09,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2024-11-17 00:27:09,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2024-11-17 00:27:09,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2024-11-17 00:27:09,537 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-17 00:27:09,732 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-17 00:27:09,735 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] [2024-11-17 00:27:09,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:27:09,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:27:09 BoogieIcfgContainer [2024-11-17 00:27:09,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:27:09,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:27:09,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:27:09,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:27:09,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:26:57" (3/4) ... [2024-11-17 00:27:09,803 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 00:27:09,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:27:09,805 INFO L158 Benchmark]: Toolchain (without parser) took 13828.82ms. Allocated memory was 71.3MB in the beginning and 197.1MB in the end (delta: 125.8MB). Free memory was 32.2MB in the beginning and 111.8MB in the end (delta: -79.5MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,805 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:27:09,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.20ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 32.4MB in the end (delta: -361.6kB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 30.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,807 INFO L158 Benchmark]: Boogie Preprocessor took 90.73ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 30.3MB in the beginning and 84.7MB in the end (delta: -54.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,807 INFO L158 Benchmark]: IcfgBuilder took 612.40ms. Allocated memory is still 107.0MB. Free memory was 84.7MB in the beginning and 62.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,808 INFO L158 Benchmark]: TraceAbstraction took 12540.19ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 61.6MB in the beginning and 112.8MB in the end (delta: -51.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-17 00:27:09,808 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 197.1MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:27:09,813 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.10ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.20ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 32.4MB in the end (delta: -361.6kB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 30.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.73ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 30.3MB in the beginning and 84.7MB in the end (delta: -54.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 612.40ms. Allocated memory is still 107.0MB. Free memory was 84.7MB in the beginning and 62.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12540.19ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 61.6MB in the beginning and 112.8MB in the end (delta: -51.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 197.1MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __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 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __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 FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) 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}] [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=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4692 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4692 mSDsluCounter, 13874 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11218 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1468 IncrementalHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 2656 mSDtfsCounter, 1468 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1005 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3251occurred in iteration=17, InterpolantAutomatonStates: 177, 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, 20 MinimizatonAttempts, 1134 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 3583 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1873 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 33 InterpolantComputations, 7 PerfectInterpolantSequences, 402/1018 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-17 00:27:09,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample