./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/locks/test_locks_6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:33:21,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:33:21,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:33:21,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:33:21,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:33:21,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:33:21,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:33:21,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:33:21,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:33:21,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:33:21,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:33:21,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:33:21,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:33:21,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:33:21,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:33:21,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:33:21,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:33:21,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:33:21,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:33:21,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:33:21,880 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:33:21,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:33:21,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:33:21,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:33:21,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:33:21,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:33:21,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:33:21,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:33:21,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:33:21,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:33:21,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:33:21,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:33:21,887 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-10 15:33:22,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:33:22,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:33:22,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:33:22,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:33:22,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:33:22,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2024-11-10 15:33:23,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:33:23,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:33:23,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-11-10 15:33:23,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2381bd72c/a647c619f34848308bc6c26d8c6291c9/FLAG6fad9c7b3 [2024-11-10 15:33:23,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2381bd72c/a647c619f34848308bc6c26d8c6291c9 [2024-11-10 15:33:23,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:33:23,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:33:23,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:23,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:33:23,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:33:23,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32077589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23, skipping insertion in model container [2024-11-10 15:33:23,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:33:23,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:23,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:33:23,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:23,894 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:33:23,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23 WrapperNode [2024-11-10 15:33:23,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:23,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:23,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:33:23,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:33:23,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,921 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-10 15:33:23,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:23,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:33:23,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:33:23,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:33:23,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 15:33:23,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:33:23,955 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:33:23,955 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:33:23,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:33:23,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (1/1) ... [2024-11-10 15:33:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:33:23,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:33:23,989 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-10 15:33:23,991 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-10 15:33:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:33:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:33:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:33:24,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:33:24,081 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:33:24,083 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:33:24,238 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 15:33:24,238 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:33:24,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:33:24,258 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:33:24,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:24 BoogieIcfgContainer [2024-11-10 15:33:24,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:33:24,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:33:24,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:33:24,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:33:24,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:33:23" (1/3) ... [2024-11-10 15:33:24,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ead7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:24, skipping insertion in model container [2024-11-10 15:33:24,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:23" (2/3) ... [2024-11-10 15:33:24,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ead7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:24, skipping insertion in model container [2024-11-10 15:33:24,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:24" (3/3) ... [2024-11-10 15:33:24,269 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-11-10 15:33:24,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:33:24,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 15:33:24,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:33:24,338 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;@1e5a4e12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:33:24,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 15:33:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:33:24,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1130587362, now seen corresponding path program 1 times [2024-11-10 15:33:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040753536] [2024-11-10 15:33:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,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-10 15:33:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040753536] [2024-11-10 15:33:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040753536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794282934] [2024-11-10 15:33:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:33:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:33:24,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:33:24,522 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 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-10 15:33:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:24,533 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2024-11-10 15:33:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:33:24,536 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-10 15:33:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:24,541 INFO L225 Difference]: With dead ends: 33 [2024-11-10 15:33:24,541 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 15:33:24,543 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-10 15:33:24,545 INFO L432 NwaCegarLoop]: 50 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, 50 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-10 15:33:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 15:33:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 15:33:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2024-11-10 15:33:24,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 6 [2024-11-10 15:33:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2024-11-10 15:33:24,571 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-10 15:33:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2024-11-10 15:33:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:33:24,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:33:24,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 163738085, now seen corresponding path program 1 times [2024-11-10 15:33:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333997099] [2024-11-10 15:33:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,644 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-10 15:33:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333997099] [2024-11-10 15:33:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333997099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362031183] [2024-11-10 15:33:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,647 INFO L87 Difference]: Start difference. First operand 30 states and 47 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-10 15:33:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:24,654 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2024-11-10 15:33:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:24,655 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-10 15:33:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:24,656 INFO L225 Difference]: With dead ends: 29 [2024-11-10 15:33:24,656 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 15:33:24,656 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-10 15:33:24,657 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:24,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 15:33:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-10 15:33:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2024-11-10 15:33:24,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 8 [2024-11-10 15:33:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,661 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. [2024-11-10 15:33:24,661 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-10 15:33:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2024-11-10 15:33:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:33:24,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:33:24,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1153075749, now seen corresponding path program 1 times [2024-11-10 15:33:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125963917] [2024-11-10 15:33:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,720 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-10 15:33:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125963917] [2024-11-10 15:33:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125963917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208004866] [2024-11-10 15:33:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:24,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:24,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,725 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:24,747 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2024-11-10 15:33:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:24,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 15:33:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:24,749 INFO L225 Difference]: With dead ends: 49 [2024-11-10 15:33:24,749 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 15:33:24,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,750 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:24,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 85 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 15:33:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-10 15:33:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 78 transitions. [2024-11-10 15:33:24,777 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 78 transitions. Word has length 15 [2024-11-10 15:33:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,778 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 78 transitions. [2024-11-10 15:33:24,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 78 transitions. [2024-11-10 15:33:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:33:24,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:33:24,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash -956562244, now seen corresponding path program 1 times [2024-11-10 15:33:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234485335] [2024-11-10 15:33:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,863 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-10 15:33:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234485335] [2024-11-10 15:33:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234485335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623154443] [2024-11-10 15:33:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,868 INFO L87 Difference]: Start difference. First operand 46 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:24,881 INFO L93 Difference]: Finished difference Result 62 states and 102 transitions. [2024-11-10 15:33:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 15:33:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:24,882 INFO L225 Difference]: With dead ends: 62 [2024-11-10 15:33:24,882 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 15:33:24,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,884 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:24,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 15:33:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2024-11-10 15:33:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.711111111111111) internal successors, (77), 45 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2024-11-10 15:33:24,889 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 15 [2024-11-10 15:33:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,889 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2024-11-10 15:33:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2024-11-10 15:33:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:33:24,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:33:24,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1384773743, now seen corresponding path program 1 times [2024-11-10 15:33:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133815426] [2024-11-10 15:33:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:24,947 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-10 15:33:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:24,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133815426] [2024-11-10 15:33:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133815426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266151980] [2024-11-10 15:33:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,951 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:24,973 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2024-11-10 15:33:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:24,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:24,976 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:33:24,976 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:33:24,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:24,977 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:24,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:33:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2024-11-10 15:33:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 60 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2024-11-10 15:33:24,990 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 16 [2024-11-10 15:33:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2024-11-10 15:33:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2024-11-10 15:33:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:33:24,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:24,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:24,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:33:24,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1581287248, now seen corresponding path program 1 times [2024-11-10 15:33:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138135550] [2024-11-10 15:33:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,029 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-10 15:33:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138135550] [2024-11-10 15:33:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138135550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936258485] [2024-11-10 15:33:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,032 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,053 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2024-11-10 15:33:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,055 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:33:25,056 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:33:25,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,057 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:33:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-10 15:33:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2024-11-10 15:33:25,066 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 16 [2024-11-10 15:33:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,067 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2024-11-10 15:33:25,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10 15:33:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2024-11-10 15:33:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:33:25,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:33:25,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 22516308, now seen corresponding path program 1 times [2024-11-10 15:33:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929669191] [2024-11-10 15:33:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:25,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929669191] [2024-11-10 15:33:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929669191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661926180] [2024-11-10 15:33:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,112 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,129 INFO L93 Difference]: Finished difference Result 94 states and 147 transitions. [2024-11-10 15:33:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-10 15:33:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,130 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:33:25,130 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:33:25,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,131 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:33:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-10 15:33:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 90 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 145 transitions. [2024-11-10 15:33:25,136 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 145 transitions. Word has length 17 [2024-11-10 15:33:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,136 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 145 transitions. [2024-11-10 15:33:25,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 145 transitions. [2024-11-10 15:33:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:33:25,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:33:25,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1774435051, now seen corresponding path program 1 times [2024-11-10 15:33:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892783662] [2024-11-10 15:33:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,160 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-10 15:33:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892783662] [2024-11-10 15:33:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892783662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767698691] [2024-11-10 15:33:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,162 INFO L87 Difference]: Start difference. First operand 91 states and 145 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,176 INFO L93 Difference]: Finished difference Result 162 states and 257 transitions. [2024-11-10 15:33:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-10 15:33:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,177 INFO L225 Difference]: With dead ends: 162 [2024-11-10 15:33:25,178 INFO L226 Difference]: Without dead ends: 162 [2024-11-10 15:33:25,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,178 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-10 15:33:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 123. [2024-11-10 15:33:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.598360655737705) internal successors, (195), 122 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 195 transitions. [2024-11-10 15:33:25,190 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 195 transitions. Word has length 17 [2024-11-10 15:33:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 195 transitions. [2024-11-10 15:33:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 195 transitions. [2024-11-10 15:33:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:33:25,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:33:25,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1970948556, now seen corresponding path program 1 times [2024-11-10 15:33:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657335994] [2024-11-10 15:33:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,226 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-10 15:33:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657335994] [2024-11-10 15:33:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657335994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526816443] [2024-11-10 15:33:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,227 INFO L87 Difference]: Start difference. First operand 123 states and 195 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,242 INFO L93 Difference]: Finished difference Result 170 states and 259 transitions. [2024-11-10 15:33:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-10 15:33:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,243 INFO L225 Difference]: With dead ends: 170 [2024-11-10 15:33:25,244 INFO L226 Difference]: Without dead ends: 170 [2024-11-10 15:33:25,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,245 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-10 15:33:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-10 15:33:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.5481927710843373) internal successors, (257), 166 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 257 transitions. [2024-11-10 15:33:25,259 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 257 transitions. Word has length 17 [2024-11-10 15:33:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,259 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 257 transitions. [2024-11-10 15:33:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 257 transitions. [2024-11-10 15:33:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:33:25,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:33:25,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 827910921, now seen corresponding path program 1 times [2024-11-10 15:33:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268525958] [2024-11-10 15:33:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,303 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-10 15:33:25,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268525958] [2024-11-10 15:33:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268525958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639084101] [2024-11-10 15:33:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,309 INFO L87 Difference]: Start difference. First operand 167 states and 257 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,323 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2024-11-10 15:33:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:33:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,324 INFO L225 Difference]: With dead ends: 174 [2024-11-10 15:33:25,324 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 15:33:25,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,324 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 15:33:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-11-10 15:33:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2024-11-10 15:33:25,339 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 18 [2024-11-10 15:33:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,339 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2024-11-10 15:33:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2024-11-10 15:33:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:33:25,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:33:25,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -969040438, now seen corresponding path program 1 times [2024-11-10 15:33:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056698463] [2024-11-10 15:33:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,374 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-10 15:33:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056698463] [2024-11-10 15:33:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056698463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040949396] [2024-11-10 15:33:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,375 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,383 INFO L93 Difference]: Finished difference Result 298 states and 443 transitions. [2024-11-10 15:33:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:33:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,385 INFO L225 Difference]: With dead ends: 298 [2024-11-10 15:33:25,385 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 15:33:25,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,385 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 15:33:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 239. [2024-11-10 15:33:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.4831932773109244) internal successors, (353), 238 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 353 transitions. [2024-11-10 15:33:25,395 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 353 transitions. Word has length 18 [2024-11-10 15:33:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 353 transitions. [2024-11-10 15:33:25,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 353 transitions. [2024-11-10 15:33:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:33:25,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:33:25,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1165553943, now seen corresponding path program 1 times [2024-11-10 15:33:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321306324] [2024-11-10 15:33:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,414 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-10 15:33:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321306324] [2024-11-10 15:33:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321306324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117029992] [2024-11-10 15:33:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,415 INFO L87 Difference]: Start difference. First operand 239 states and 353 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,427 INFO L93 Difference]: Finished difference Result 322 states and 455 transitions. [2024-11-10 15:33:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:33:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,428 INFO L225 Difference]: With dead ends: 322 [2024-11-10 15:33:25,428 INFO L226 Difference]: Without dead ends: 322 [2024-11-10 15:33:25,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,429 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-10 15:33:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-11-10 15:33:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4245283018867925) internal successors, (453), 318 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 453 transitions. [2024-11-10 15:33:25,438 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 453 transitions. Word has length 18 [2024-11-10 15:33:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,438 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 453 transitions. [2024-11-10 15:33:25,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 453 transitions. [2024-11-10 15:33:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:33:25,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:33:25,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash 25333421, now seen corresponding path program 1 times [2024-11-10 15:33:25,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155999655] [2024-11-10 15:33:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,469 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-10 15:33:25,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155999655] [2024-11-10 15:33:25,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155999655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585977192] [2024-11-10 15:33:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,474 INFO L87 Difference]: Start difference. First operand 319 states and 453 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,487 INFO L93 Difference]: Finished difference Result 330 states and 455 transitions. [2024-11-10 15:33:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:33:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,489 INFO L225 Difference]: With dead ends: 330 [2024-11-10 15:33:25,489 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 15:33:25,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,490 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 15:33:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2024-11-10 15:33:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.3895705521472392) internal successors, (453), 326 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 453 transitions. [2024-11-10 15:33:25,497 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 453 transitions. Word has length 19 [2024-11-10 15:33:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 453 transitions. [2024-11-10 15:33:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 453 transitions. [2024-11-10 15:33:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:33:25,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:33:25,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1771617938, now seen corresponding path program 1 times [2024-11-10 15:33:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641716704] [2024-11-10 15:33:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,531 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-10 15:33:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641716704] [2024-11-10 15:33:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641716704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191977854] [2024-11-10 15:33:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,533 INFO L87 Difference]: Start difference. First operand 327 states and 453 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,540 INFO L93 Difference]: Finished difference Result 554 states and 751 transitions. [2024-11-10 15:33:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:33:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,543 INFO L225 Difference]: With dead ends: 554 [2024-11-10 15:33:25,543 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 15:33:25,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,543 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 15:33:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 471. [2024-11-10 15:33:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.3553191489361702) internal successors, (637), 470 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 637 transitions. [2024-11-10 15:33:25,553 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 637 transitions. Word has length 19 [2024-11-10 15:33:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 637 transitions. [2024-11-10 15:33:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 637 transitions. [2024-11-10 15:33:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:33:25,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:33:25,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1968131443, now seen corresponding path program 1 times [2024-11-10 15:33:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349993405] [2024-11-10 15:33:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,588 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-10 15:33:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349993405] [2024-11-10 15:33:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349993405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785458705] [2024-11-10 15:33:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,590 INFO L87 Difference]: Start difference. First operand 471 states and 637 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,600 INFO L93 Difference]: Finished difference Result 618 states and 791 transitions. [2024-11-10 15:33:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:33:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,602 INFO L225 Difference]: With dead ends: 618 [2024-11-10 15:33:25,602 INFO L226 Difference]: Without dead ends: 618 [2024-11-10 15:33:25,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,604 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-10 15:33:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-10 15:33:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.285016286644951) internal successors, (789), 614 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 789 transitions. [2024-11-10 15:33:25,628 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 789 transitions. Word has length 19 [2024-11-10 15:33:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,628 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 789 transitions. [2024-11-10 15:33:25,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 789 transitions. [2024-11-10 15:33:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:33:25,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:33:25,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 915227970, now seen corresponding path program 1 times [2024-11-10 15:33:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931756028] [2024-11-10 15:33:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,655 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-10 15:33:25,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931756028] [2024-11-10 15:33:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931756028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869493173] [2024-11-10 15:33:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,658 INFO L87 Difference]: Start difference. First operand 615 states and 789 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,668 INFO L93 Difference]: Finished difference Result 634 states and 791 transitions. [2024-11-10 15:33:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-10 15:33:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,671 INFO L225 Difference]: With dead ends: 634 [2024-11-10 15:33:25,671 INFO L226 Difference]: Without dead ends: 634 [2024-11-10 15:33:25,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,673 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-10 15:33:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-10 15:33:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.2523809523809524) internal successors, (789), 630 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 789 transitions. [2024-11-10 15:33:25,685 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 789 transitions. Word has length 20 [2024-11-10 15:33:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,686 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 789 transitions. [2024-11-10 15:33:25,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 789 transitions. [2024-11-10 15:33:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:33:25,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:33:25,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -881723389, now seen corresponding path program 1 times [2024-11-10 15:33:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788090745] [2024-11-10 15:33:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,712 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-10 15:33:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788090745] [2024-11-10 15:33:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788090745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373806314] [2024-11-10 15:33:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,715 INFO L87 Difference]: Start difference. First operand 631 states and 789 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,726 INFO L93 Difference]: Finished difference Result 1031 states and 1237 transitions. [2024-11-10 15:33:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-10 15:33:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,729 INFO L225 Difference]: With dead ends: 1031 [2024-11-10 15:33:25,729 INFO L226 Difference]: Without dead ends: 1031 [2024-11-10 15:33:25,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,730 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-10 15:33:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 935. [2024-11-10 15:33:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.221627408993576) internal successors, (1141), 934 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1141 transitions. [2024-11-10 15:33:25,746 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1141 transitions. Word has length 20 [2024-11-10 15:33:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1141 transitions. [2024-11-10 15:33:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1141 transitions. [2024-11-10 15:33:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:33:25,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:25,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:33:25,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:25,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:25,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1078236894, now seen corresponding path program 1 times [2024-11-10 15:33:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142583362] [2024-11-10 15:33:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:25,774 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-10 15:33:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142583362] [2024-11-10 15:33:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142583362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312605438] [2024-11-10 15:33:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:25,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,775 INFO L87 Difference]: Start difference. First operand 935 states and 1141 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:25,795 INFO L93 Difference]: Finished difference Result 1188 states and 1347 transitions. [2024-11-10 15:33:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-10 15:33:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:25,797 INFO L225 Difference]: With dead ends: 1188 [2024-11-10 15:33:25,797 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:33:25,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:25,797 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:33:25,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:33:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:33:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:33:25,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-11-10 15:33:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:33:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:33:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:33:25,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:33:25,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 15:33:25,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 15:33:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:33:25,808 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:25,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:33:25,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:33:25 BoogieIcfgContainer [2024-11-10 15:33:25,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:33:25,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:33:25,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:33:25,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:33:25,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:24" (3/4) ... [2024-11-10 15:33:25,816 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:33:25,824 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 15:33:25,824 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 15:33:25,824 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:33:25,825 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:33:25,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:33:25,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:33:25,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:33:25,904 INFO L158 Benchmark]: Toolchain (without parser) took 2242.05ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 147.7MB in the beginning and 146.3MB in the end (delta: 1.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,905 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:33:25,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.99ms. Allocated memory is still 176.2MB. Free memory was 147.5MB in the beginning and 138.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.47ms. Allocated memory is still 176.2MB. Free memory was 138.4MB in the beginning and 137.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,905 INFO L158 Benchmark]: Boogie Preprocessor took 31.82ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,905 INFO L158 Benchmark]: IcfgBuilder took 305.16ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 122.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,906 INFO L158 Benchmark]: TraceAbstraction took 1550.93ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 121.6MB in the beginning and 151.5MB in the end (delta: -29.9MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,906 INFO L158 Benchmark]: Witness Printer took 91.00ms. Allocated memory is still 222.3MB. Free memory was 151.5MB in the beginning and 146.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:33:25,907 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 125.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.99ms. Allocated memory is still 176.2MB. Free memory was 147.5MB in the beginning and 138.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.47ms. Allocated memory is still 176.2MB. Free memory was 138.4MB in the beginning and 137.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.82ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 305.16ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 122.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1550.93ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 121.6MB in the beginning and 151.5MB in the end (delta: -29.9MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 91.00ms. Allocated memory is still 222.3MB. Free memory was 151.5MB in the beginning and 146.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 1527 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 975 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=935occurred in iteration=17, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 345 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:33:25,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE