./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 18:21:36,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:21:36,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:21:36,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:21:36,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:21:36,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:21:36,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:21:36,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:21:36,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:21:36,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:21:36,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:21:36,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:21:36,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:21:36,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:21:36,559 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:21:36,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:21:36,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:21:36,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:21:36,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:21:36,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:21:36,561 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:21:36,567 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:21:36,567 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:21:36,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:21:36,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:21:36,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:21:36,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:21:36,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:21:36,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:21:36,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:21:36,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:21:36,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:21:36,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:21:36,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:21:36,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:21:36,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:21:36,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:21:36,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:21:36,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:21:36,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:21:36,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:21:36,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:21:36,573 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-clean/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-clean/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-10-11 18:21:36,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:21:36,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:21:36,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:21:36,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:21:36,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:21:36,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-10-11 18:21:38,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:21:38,582 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:21:38,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-10-11 18:21:38,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ffef9294/8b5d259b81d54d7fb0caa097802acf55/FLAG7e7cc2284 [2024-10-11 18:21:38,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ffef9294/8b5d259b81d54d7fb0caa097802acf55 [2024-10-11 18:21:38,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:21:38,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:21:38,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:21:38,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:21:38,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:21:38,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:38,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa2843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38, skipping insertion in model container [2024-10-11 18:21:38,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:38,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:21:38,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:21:38,911 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:21:38,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:21:38,959 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:21:38,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38 WrapperNode [2024-10-11 18:21:38,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:21:38,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:21:38,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:21:38,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:21:38,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:38,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:38,998 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2024-10-11 18:21:39,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:21:39,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:21:39,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:21:39,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:21:39,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,040 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-10-11 18:21:39,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:21:39,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:21:39,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:21:39,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:21:39,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (1/1) ... [2024-10-11 18:21:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:21:39,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:21:39,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:21:39,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:21:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:21:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:21:39,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:21:39,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:21:39,219 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:21:39,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:21:39,385 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 18:21:39,385 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:21:39,414 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:21:39,415 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:21:39,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:39 BoogieIcfgContainer [2024-10-11 18:21:39,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:21:39,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:21:39,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:21:39,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:21:39,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:21:38" (1/3) ... [2024-10-11 18:21:39,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc087e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:39, skipping insertion in model container [2024-10-11 18:21:39,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:38" (2/3) ... [2024-10-11 18:21:39,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc087e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:39, skipping insertion in model container [2024-10-11 18:21:39,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:39" (3/3) ... [2024-10-11 18:21:39,427 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-10-11 18:21:39,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:21:39,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 18:21:39,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:21:39,499 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;@59e8266c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:21:39,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 18:21:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 25 states have (on average 1.92) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:21:39,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:39,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:21:39,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:39,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 5064538, now seen corresponding path program 1 times [2024-10-11 18:21:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701889826] [2024-10-11 18:21:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701889826] [2024-10-11 18:21:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701889826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:21:39,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056544269] [2024-10-11 18:21:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:39,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:21:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:21:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:21:39,767 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.92) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:39,800 INFO L93 Difference]: Finished difference Result 28 states and 45 transitions. [2024-10-11 18:21:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:21:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:21:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:39,811 INFO L225 Difference]: With dead ends: 28 [2024-10-11 18:21:39,811 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 18:21:39,813 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-10-11 18:21:39,820 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:39,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 18:21:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 18:21:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2024-10-11 18:21:39,858 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 4 [2024-10-11 18:21:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2024-10-11 18:21:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2024-10-11 18:21:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:21:39,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:39,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:21:39,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:21:39,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 153649553, now seen corresponding path program 1 times [2024-10-11 18:21:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11178262] [2024-10-11 18:21:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11178262] [2024-10-11 18:21:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11178262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:21:39,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035834770] [2024-10-11 18:21:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:39,964 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:39,974 INFO L93 Difference]: Finished difference Result 26 states and 43 transitions. [2024-10-11 18:21:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:39,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:21:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:39,976 INFO L225 Difference]: With dead ends: 26 [2024-10-11 18:21:39,977 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 18:21:39,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:39,978 INFO L432 NwaCegarLoop]: 42 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, 42 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-10-11 18:21:39,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 18:21:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 18:21:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2024-10-11 18:21:39,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 5 [2024-10-11 18:21:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:39,988 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2024-10-11 18:21:39,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-10-11 18:21:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:21:39,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:39,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:39,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:21:39,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:39,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1031790687, now seen corresponding path program 1 times [2024-10-11 18:21:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814927348] [2024-10-11 18:21:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814927348] [2024-10-11 18:21:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814927348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56005659] [2024-10-11 18:21:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,071 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,102 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2024-10-11 18:21:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:21:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,105 INFO L225 Difference]: With dead ends: 46 [2024-10-11 18:21:40,106 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 18:21:40,106 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-10-11 18:21:40,107 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 18:21:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2024-10-11 18:21:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 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-10-11 18:21:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2024-10-11 18:21:40,117 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2024-10-11 18:21:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2024-10-11 18:21:40,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2024-10-11 18:21:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:21:40,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:21:40,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 638763677, now seen corresponding path program 1 times [2024-10-11 18:21:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097282261] [2024-10-11 18:21:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097282261] [2024-10-11 18:21:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097282261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181439919] [2024-10-11 18:21:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,200 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,229 INFO L93 Difference]: Finished difference Result 46 states and 76 transitions. [2024-10-11 18:21:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:21:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,231 INFO L225 Difference]: With dead ends: 46 [2024-10-11 18:21:40,232 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 18:21:40,232 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-10-11 18:21:40,233 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 86 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 18:21:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-11 18:21:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2024-10-11 18:21:40,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 13 [2024-10-11 18:21:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2024-10-11 18:21:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2024-10-11 18:21:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:21:40,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:21:40,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1927390439, now seen corresponding path program 1 times [2024-10-11 18:21:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816924199] [2024-10-11 18:21:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816924199] [2024-10-11 18:21:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816924199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961134783] [2024-10-11 18:21:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,305 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,334 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2024-10-11 18:21:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-11 18:21:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,336 INFO L225 Difference]: With dead ends: 49 [2024-10-11 18:21:40,336 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 18:21:40,338 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-10-11 18:21:40,339 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 18:21:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-11 18:21:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2024-10-11 18:21:40,352 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 14 [2024-10-11 18:21:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,352 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2024-10-11 18:21:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2024-10-11 18:21:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:21:40,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:21:40,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1666512279, now seen corresponding path program 1 times [2024-10-11 18:21:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328081545] [2024-10-11 18:21:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328081545] [2024-10-11 18:21:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328081545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511775255] [2024-10-11 18:21:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,429 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,452 INFO L93 Difference]: Finished difference Result 84 states and 139 transitions. [2024-10-11 18:21:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-11 18:21:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,454 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:21:40,454 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:21:40,454 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-10-11 18:21:40,455 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:21:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-10-11 18:21:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2024-10-11 18:21:40,472 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 14 [2024-10-11 18:21:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,473 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 101 transitions. [2024-10-11 18:21:40,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 101 transitions. [2024-10-11 18:21:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:21:40,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:21:40,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2059539289, now seen corresponding path program 1 times [2024-10-11 18:21:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356922316] [2024-10-11 18:21:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356922316] [2024-10-11 18:21:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356922316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314929180] [2024-10-11 18:21:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,536 INFO L87 Difference]: Start difference. First operand 61 states and 101 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,560 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. [2024-10-11 18:21:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-11 18:21:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,561 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:21:40,562 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:21:40,562 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-10-11 18:21:40,563 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:21:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-10-11 18:21:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 135 transitions. [2024-10-11 18:21:40,582 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 135 transitions. Word has length 14 [2024-10-11 18:21:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,583 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 135 transitions. [2024-10-11 18:21:40,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 135 transitions. [2024-10-11 18:21:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:21:40,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:21:40,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -115612312, now seen corresponding path program 1 times [2024-10-11 18:21:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208878950] [2024-10-11 18:21:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208878950] [2024-10-11 18:21:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208878950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871053560] [2024-10-11 18:21:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,638 INFO L87 Difference]: Start difference. First operand 83 states and 135 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-10-11 18:21:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,656 INFO L93 Difference]: Finished difference Result 88 states and 137 transitions. [2024-10-11 18:21:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,657 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-10-11 18:21:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,658 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:21:40,658 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:21:40,658 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-10-11 18:21:40,659 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:21:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-10-11 18:21:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-11 18:21:40,671 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2024-10-11 18:21:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,671 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-11 18:21:40,671 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-10-11 18:21:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-11 18:21:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:21:40,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:21:40,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 585452266, now seen corresponding path program 1 times [2024-10-11 18:21:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614649992] [2024-10-11 18:21:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614649992] [2024-10-11 18:21:40,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614649992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539711465] [2024-10-11 18:21:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,721 INFO L87 Difference]: Start difference. First operand 85 states and 135 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-10-11 18:21:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,746 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-10-11 18:21:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,747 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-10-11 18:21:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,748 INFO L225 Difference]: With dead ends: 160 [2024-10-11 18:21:40,748 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 18:21:40,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-10-11 18:21:40,749 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 18:21:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-10-11 18:21:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2024-10-11 18:21:40,771 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 15 [2024-10-11 18:21:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,771 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2024-10-11 18:21:40,772 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-10-11 18:21:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2024-10-11 18:21:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:21:40,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:21:40,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 978479276, now seen corresponding path program 1 times [2024-10-11 18:21:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523683418] [2024-10-11 18:21:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523683418] [2024-10-11 18:21:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523683418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860364132] [2024-10-11 18:21:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,812 INFO L87 Difference]: Start difference. First operand 157 states and 243 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-10-11 18:21:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,830 INFO L93 Difference]: Finished difference Result 192 states and 297 transitions. [2024-10-11 18:21:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,831 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-10-11 18:21:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,832 INFO L225 Difference]: With dead ends: 192 [2024-10-11 18:21:40,832 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 18:21:40,832 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-10-11 18:21:40,833 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 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-10-11 18:21:40,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 18:21:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2024-10-11 18:21:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2024-10-11 18:21:40,850 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 15 [2024-10-11 18:21:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2024-10-11 18:21:40,851 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-10-11 18:21:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2024-10-11 18:21:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:21:40,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:21:40,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 975822418, now seen corresponding path program 1 times [2024-10-11 18:21:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972212179] [2024-10-11 18:21:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972212179] [2024-10-11 18:21:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972212179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38143435] [2024-10-11 18:21:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,894 INFO L87 Difference]: Start difference. First operand 157 states and 239 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-10-11 18:21:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,914 INFO L93 Difference]: Finished difference Result 276 states and 417 transitions. [2024-10-11 18:21:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,915 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-10-11 18:21:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,916 INFO L225 Difference]: With dead ends: 276 [2024-10-11 18:21:40,916 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 18:21:40,916 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-10-11 18:21:40,917 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 18:21:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 225. [2024-10-11 18:21:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2024-10-11 18:21:40,929 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 16 [2024-10-11 18:21:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,929 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2024-10-11 18:21:40,929 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-10-11 18:21:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2024-10-11 18:21:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:21:40,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:40,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:21:40,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 582795408, now seen corresponding path program 1 times [2024-10-11 18:21:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518304202] [2024-10-11 18:21:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518304202] [2024-10-11 18:21:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518304202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600809136] [2024-10-11 18:21:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:40,964 INFO L87 Difference]: Start difference. First operand 225 states and 335 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-10-11 18:21:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:40,982 INFO L93 Difference]: Finished difference Result 300 states and 429 transitions. [2024-10-11 18:21:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:40,983 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-10-11 18:21:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:40,984 INFO L225 Difference]: With dead ends: 300 [2024-10-11 18:21:40,984 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 18:21:40,985 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-10-11 18:21:40,985 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:40,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 18:21:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2024-10-11 18:21:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 427 transitions. [2024-10-11 18:21:40,997 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 427 transitions. Word has length 16 [2024-10-11 18:21:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:40,999 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 427 transitions. [2024-10-11 18:21:40,999 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-10-11 18:21:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 427 transitions. [2024-10-11 18:21:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:21:41,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:21:41,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash 192405813, now seen corresponding path program 1 times [2024-10-11 18:21:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114058684] [2024-10-11 18:21:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114058684] [2024-10-11 18:21:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114058684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423672414] [2024-10-11 18:21:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,044 INFO L87 Difference]: Start difference. First operand 297 states and 427 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-10-11 18:21:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,058 INFO L93 Difference]: Finished difference Result 312 states and 437 transitions. [2024-10-11 18:21:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,059 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-10-11 18:21:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,060 INFO L225 Difference]: With dead ends: 312 [2024-10-11 18:21:41,060 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 18:21:41,060 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-10-11 18:21:41,061 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 18:21:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2024-10-11 18:21:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 435 transitions. [2024-10-11 18:21:41,072 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 435 transitions. Word has length 17 [2024-10-11 18:21:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,073 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 435 transitions. [2024-10-11 18:21:41,073 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-10-11 18:21:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 435 transitions. [2024-10-11 18:21:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:21:41,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:21:41,074 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 893470391, now seen corresponding path program 1 times [2024-10-11 18:21:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996731337] [2024-10-11 18:21:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,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-10-11 18:21:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996731337] [2024-10-11 18:21:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996731337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232104434] [2024-10-11 18:21:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,113 INFO L87 Difference]: Start difference. First operand 309 states and 435 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-10-11 18:21:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,128 INFO L93 Difference]: Finished difference Result 520 states and 717 transitions. [2024-10-11 18:21:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,129 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-10-11 18:21:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,133 INFO L225 Difference]: With dead ends: 520 [2024-10-11 18:21:41,133 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 18:21:41,133 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-10-11 18:21:41,134 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 18:21:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 453. [2024-10-11 18:21:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2024-10-11 18:21:41,159 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 17 [2024-10-11 18:21:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2024-10-11 18:21:41,160 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-10-11 18:21:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2024-10-11 18:21:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:21:41,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:21:41,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash 500443381, now seen corresponding path program 1 times [2024-10-11 18:21:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762788603] [2024-10-11 18:21:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762788603] [2024-10-11 18:21:41,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762788603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485236140] [2024-10-11 18:21:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,192 INFO L87 Difference]: Start difference. First operand 453 states and 619 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-10-11 18:21:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,206 INFO L93 Difference]: Finished difference Result 584 states and 757 transitions. [2024-10-11 18:21:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,206 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-10-11 18:21:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,208 INFO L225 Difference]: With dead ends: 584 [2024-10-11 18:21:41,209 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 18:21:41,209 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-10-11 18:21:41,209 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 18:21:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 581. [2024-10-11 18:21:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 755 transitions. [2024-10-11 18:21:41,223 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 755 transitions. Word has length 17 [2024-10-11 18:21:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 755 transitions. [2024-10-11 18:21:41,224 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-10-11 18:21:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 755 transitions. [2024-10-11 18:21:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:21:41,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:21:41,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1934470843, now seen corresponding path program 1 times [2024-10-11 18:21:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440749365] [2024-10-11 18:21:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440749365] [2024-10-11 18:21:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440749365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648285387] [2024-10-11 18:21:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,246 INFO L87 Difference]: Start difference. First operand 581 states and 755 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-10-11 18:21:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,258 INFO L93 Difference]: Finished difference Result 600 states and 757 transitions. [2024-10-11 18:21:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,258 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-10-11 18:21:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,260 INFO L225 Difference]: With dead ends: 600 [2024-10-11 18:21:41,260 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 18:21:41,261 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-10-11 18:21:41,261 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 18:21:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2024-10-11 18:21:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 755 transitions. [2024-10-11 18:21:41,277 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 755 transitions. Word has length 18 [2024-10-11 18:21:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,278 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 755 transitions. [2024-10-11 18:21:41,278 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-10-11 18:21:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 755 transitions. [2024-10-11 18:21:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:21:41,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:21:41,285 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1659431875, now seen corresponding path program 1 times [2024-10-11 18:21:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267688379] [2024-10-11 18:21:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267688379] [2024-10-11 18:21:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267688379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537110972] [2024-10-11 18:21:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,321 INFO L87 Difference]: Start difference. First operand 597 states and 755 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-10-11 18:21:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,335 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2024-10-11 18:21:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,336 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-10-11 18:21:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,341 INFO L225 Difference]: With dead ends: 965 [2024-10-11 18:21:41,341 INFO L226 Difference]: Without dead ends: 965 [2024-10-11 18:21:41,341 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-10-11 18:21:41,342 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-11 18:21:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 901. [2024-10-11 18:21:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2024-10-11 18:21:41,364 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 18 [2024-10-11 18:21:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,365 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2024-10-11 18:21:41,365 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-10-11 18:21:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2024-10-11 18:21:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:21:41,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:21:41,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:21:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:21:41,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 18:21:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:21:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2052458885, now seen corresponding path program 1 times [2024-10-11 18:21:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:21:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150161628] [2024-10-11 18:21:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:21:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:21:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:21:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:21:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:21:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150161628] [2024-10-11 18:21:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150161628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:21:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:21:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:21:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930673426] [2024-10-11 18:21:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:21:41,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:21:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:21:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:21:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:21:41,411 INFO L87 Difference]: Start difference. First operand 901 states and 1107 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-10-11 18:21:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:21:41,430 INFO L93 Difference]: Finished difference Result 1122 states and 1281 transitions. [2024-10-11 18:21:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:21:41,432 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-10-11 18:21:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:21:41,432 INFO L225 Difference]: With dead ends: 1122 [2024-10-11 18:21:41,432 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 18:21:41,432 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-10-11 18:21:41,433 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:21:41,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:21:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 18:21:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 18:21:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:21:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 18:21:41,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-10-11 18:21:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:21:41,434 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 18:21:41,434 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-10-11 18:21:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 18:21:41,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 18:21:41,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-11 18:21:41,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-11 18:21:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:21:41,441 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-10-11 18:21:41,445 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:21:41,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:21:41 BoogieIcfgContainer [2024-10-11 18:21:41,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:21:41,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:21:41,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:21:41,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:21:41,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:39" (3/4) ... [2024-10-11 18:21:41,453 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 18:21:41,462 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 18:21:41,462 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 18:21:41,462 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 18:21:41,462 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 18:21:41,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 18:21:41,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 18:21:41,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:21:41,558 INFO L158 Benchmark]: Toolchain (without parser) took 2927.25ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 59.3MB in the end (delta: 56.6MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,558 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:21:41,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.71ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 103.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.22ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,559 INFO L158 Benchmark]: Boogie Preprocessor took 62.29ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:21:41,559 INFO L158 Benchmark]: RCFGBuilder took 350.86ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 86.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,559 INFO L158 Benchmark]: TraceAbstraction took 2030.64ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 64.5MB in the end (delta: 21.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,559 INFO L158 Benchmark]: Witness Printer took 107.85ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 59.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 18:21:41,561 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.17ms. Allocated memory is still 96.5MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.71ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 103.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.22ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.29ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.86ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 86.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2030.64ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 64.5MB in the end (delta: 21.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 107.85ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 59.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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: 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, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 1420 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 898 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred 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, 282 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 477 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-10-11 18:21:41,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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