./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:47:42,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:47:42,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 17:47:42,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:47:42,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:47:42,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:47:42,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:47:42,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:47:42,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:47:42,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:47:42,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:47:42,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:47:42,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:47:42,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:47:42,102 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:47:42,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:47:42,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:47:42,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:47:42,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:47:42,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:47:42,106 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:47:42,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:47:42,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:47:42,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:47:42,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:47:42,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:47:42,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:47:42,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:47:42,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:47:42,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:47:42,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:47:42,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:47:42,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:47:42,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2024-10-14 17:47:42,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:47:42,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:47:42,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:47:42,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:47:42,349 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:47:42,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-10-14 17:47:43,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:47:43,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:47:43,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-10-14 17:47:43,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1fd74bb0/b7ce6295105443a18e5f7610d311fbd9/FLAGcd7ed397f [2024-10-14 17:47:44,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1fd74bb0/b7ce6295105443a18e5f7610d311fbd9 [2024-10-14 17:47:44,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:47:44,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:47:44,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:47:44,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:47:44,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:47:44,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b49b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44, skipping insertion in model container [2024-10-14 17:47:44,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:47:44,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:47:44,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:47:44,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:47:44,409 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:47:44,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44 WrapperNode [2024-10-14 17:47:44,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:47:44,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:47:44,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:47:44,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:47:44,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,441 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2024-10-14 17:47:44,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:47:44,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:47:44,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:47:44,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:47:44,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,463 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [6, 3, 5, 4, 3]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 10 writes are split as follows [3, 1, 3, 2, 1]. [2024-10-14 17:47:44,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:47:44,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:47:44,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:47:44,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:47:44,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (1/1) ... [2024-10-14 17:47:44,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:47:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:47:44,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:47:44,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:47:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:47:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:47:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-14 17:47:44,538 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:47:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:47:44,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:47:44,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:47:44,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:47:44,808 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-14 17:47:44,808 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:47:44,831 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:47:44,832 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:47:44,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:44 BoogieIcfgContainer [2024-10-14 17:47:44,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:47:44,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:47:44,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:47:44,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:47:44,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:47:44" (1/3) ... [2024-10-14 17:47:44,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65dd90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:44, skipping insertion in model container [2024-10-14 17:47:44,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:44" (2/3) ... [2024-10-14 17:47:44,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65dd90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:44, skipping insertion in model container [2024-10-14 17:47:44,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:44" (3/3) ... [2024-10-14 17:47:44,839 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-10-14 17:47:44,851 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:47:44,853 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-10-14 17:47:44,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:47:44,891 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;@31352f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:47:44,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-10-14 17:47:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 32 states have (on average 2.59375) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:47:44,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:44,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:47:44,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash 159712436, now seen corresponding path program 1 times [2024-10-14 17:47:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652857665] [2024-10-14 17:47:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:45,322 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-14 17:47:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652857665] [2024-10-14 17:47:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652857665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:45,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:45,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:45,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942436121] [2024-10-14 17:47:45,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,351 INFO L87 Difference]: Start difference. First operand has 79 states, 32 states have (on average 2.59375) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:45,443 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-10-14 17:47:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:47:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:45,451 INFO L225 Difference]: With dead ends: 76 [2024-10-14 17:47:45,451 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 17:47:45,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,454 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:45,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 17:47:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 17:47:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 32 states have (on average 2.40625) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-10-14 17:47:45,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2024-10-14 17:47:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:45,519 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-10-14 17:47:45,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-10-14 17:47:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:47:45,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:45,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:47:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:47:45,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 159712437, now seen corresponding path program 1 times [2024-10-14 17:47:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265608350] [2024-10-14 17:47:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:45,723 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-14 17:47:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265608350] [2024-10-14 17:47:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265608350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764419563] [2024-10-14 17:47:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,727 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:45,794 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-10-14 17:47:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:47:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:45,796 INFO L225 Difference]: With dead ends: 72 [2024-10-14 17:47:45,796 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 17:47:45,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,797 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:45,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 43 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 17:47:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 17:47:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 32 states have (on average 2.3125) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-14 17:47:45,803 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 5 [2024-10-14 17:47:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-14 17:47:45,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-14 17:47:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:47:45,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:45,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:47:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:47:45,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 656118194, now seen corresponding path program 1 times [2024-10-14 17:47:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265834517] [2024-10-14 17:47:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:45,890 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-14 17:47:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265834517] [2024-10-14 17:47:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265834517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:45,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745026873] [2024-10-14 17:47:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,892 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:45,955 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-14 17:47:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:45,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:47:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:45,958 INFO L225 Difference]: With dead ends: 68 [2024-10-14 17:47:45,960 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 17:47:45,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:45,961 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:45,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 39 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 17:47:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 17:47:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 32 states have (on average 2.1875) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-14 17:47:45,965 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 6 [2024-10-14 17:47:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:45,965 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-14 17:47:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-14 17:47:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:47:45,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:45,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:47:45,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:47:45,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 656118195, now seen corresponding path program 1 times [2024-10-14 17:47:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935644553] [2024-10-14 17:47:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,081 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-14 17:47:46,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935644553] [2024-10-14 17:47:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935644553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960598198] [2024-10-14 17:47:46,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,083 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,138 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-14 17:47:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:47:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,139 INFO L225 Difference]: With dead ends: 64 [2024-10-14 17:47:46,140 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 17:47:46,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,141 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 17:47:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 17:47:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0625) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-10-14 17:47:46,149 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2024-10-14 17:47:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-10-14 17:47:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-10-14 17:47:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:47:46,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:47:46,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1135172489, now seen corresponding path program 1 times [2024-10-14 17:47:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488429726] [2024-10-14 17:47:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,205 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-14 17:47:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488429726] [2024-10-14 17:47:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488429726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455087267] [2024-10-14 17:47:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,209 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,256 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-10-14 17:47:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:47:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,257 INFO L225 Difference]: With dead ends: 59 [2024-10-14 17:47:46,257 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 17:47:46,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,258 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 17:47:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 17:47:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.90625) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-10-14 17:47:46,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 7 [2024-10-14 17:47:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,264 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-14 17:47:46,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-10-14 17:47:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:47:46,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:47:46,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1135172488, now seen corresponding path program 1 times [2024-10-14 17:47:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817091217] [2024-10-14 17:47:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,325 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-14 17:47:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817091217] [2024-10-14 17:47:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817091217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693519953] [2024-10-14 17:47:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,327 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,384 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-14 17:47:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:47:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,385 INFO L225 Difference]: With dead ends: 54 [2024-10-14 17:47:46,385 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 17:47:46,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,386 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 17:47:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 17:47:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.75) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-10-14 17:47:46,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2024-10-14 17:47:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-10-14 17:47:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-10-14 17:47:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:47:46,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:47:46,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash -830608811, now seen corresponding path program 1 times [2024-10-14 17:47:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374510867] [2024-10-14 17:47:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,449 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-14 17:47:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374510867] [2024-10-14 17:47:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374510867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164122011] [2024-10-14 17:47:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,452 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,491 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-14 17:47:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:47:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,492 INFO L225 Difference]: With dead ends: 51 [2024-10-14 17:47:46,493 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 17:47:46,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,494 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 17:47:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 17:47:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.65625) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-10-14 17:47:46,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 8 [2024-10-14 17:47:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-10-14 17:47:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-10-14 17:47:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:47:46,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:47:46,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -830608810, now seen corresponding path program 1 times [2024-10-14 17:47:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853801680] [2024-10-14 17:47:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,582 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-14 17:47:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853801680] [2024-10-14 17:47:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853801680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260222756] [2024-10-14 17:47:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,585 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,617 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-14 17:47:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:47:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,618 INFO L225 Difference]: With dead ends: 48 [2024-10-14 17:47:46,619 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 17:47:46,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,620 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 17:47:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 17:47:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-14 17:47:46,624 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 8 [2024-10-14 17:47:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,624 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-14 17:47:46,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-14 17:47:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:47:46,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:47:46,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 20930618, now seen corresponding path program 1 times [2024-10-14 17:47:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978568155] [2024-10-14 17:47:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,677 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-14 17:47:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978568155] [2024-10-14 17:47:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978568155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622097934] [2024-10-14 17:47:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,683 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,724 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-14 17:47:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:47:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,725 INFO L225 Difference]: With dead ends: 42 [2024-10-14 17:47:46,725 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 17:47:46,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,727 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 17:47:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 17:47:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.375) internal successors, (44), 39 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-14 17:47:46,733 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 9 [2024-10-14 17:47:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-14 17:47:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-14 17:47:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:47:46,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:47:46,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 20930619, now seen corresponding path program 1 times [2024-10-14 17:47:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840960774] [2024-10-14 17:47:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,790 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-14 17:47:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840960774] [2024-10-14 17:47:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840960774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:47:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578631527] [2024-10-14 17:47:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:47:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:47:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,792 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:46,822 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-14 17:47:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:47:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:47:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:46,823 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:47:46,824 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:47:46,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:47:46,824 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:47:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 17:47:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-14 17:47:46,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 9 [2024-10-14 17:47:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:46,828 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-14 17:47:46,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:47:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-14 17:47:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:47:46,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:46,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:46,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:47:46,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:46,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash 562926510, now seen corresponding path program 1 times [2024-10-14 17:47:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:46,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809025606] [2024-10-14 17:47:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:46,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:47:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:46,939 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-14 17:47:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809025606] [2024-10-14 17:47:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809025606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:47:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379467909] [2024-10-14 17:47:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:47:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:46,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:47:46,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:47:46,942 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:47,001 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 17:47:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:47:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 17:47:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:47,002 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:47:47,002 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:47:47,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:47:47,002 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:47,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:47:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 17:47:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-14 17:47:47,004 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 14 [2024-10-14 17:47:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:47,004 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-14 17:47:47,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-14 17:47:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:47:47,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:47,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:47,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:47:47,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1396259548, now seen corresponding path program 1 times [2024-10-14 17:47:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191265735] [2024-10-14 17:47:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:47:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,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-14 17:47:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191265735] [2024-10-14 17:47:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191265735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:47:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975872717] [2024-10-14 17:47:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:47,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:47:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:47:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:47:47,113 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:47,168 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-14 17:47:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:47:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-14 17:47:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:47,169 INFO L225 Difference]: With dead ends: 50 [2024-10-14 17:47:47,169 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 17:47:47,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:47:47,169 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:47,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 17:47:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2024-10-14 17:47:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-14 17:47:47,173 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2024-10-14 17:47:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-14 17:47:47,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-14 17:47:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:47:47,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:47,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:47,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:47:47,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 484416305, now seen corresponding path program 1 times [2024-10-14 17:47:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286043084] [2024-10-14 17:47:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:47:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,288 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-14 17:47:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:47,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286043084] [2024-10-14 17:47:47,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286043084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:47:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748445750] [2024-10-14 17:47:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:47:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:47:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:47:47,290 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:47,340 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-10-14 17:47:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:47:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-14 17:47:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:47,341 INFO L225 Difference]: With dead ends: 56 [2024-10-14 17:47:47,341 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 17:47:47,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:47:47,342 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:47,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:47:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 17:47:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-14 17:47:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:47:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-10-14 17:47:47,346 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 22 [2024-10-14 17:47:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-10-14 17:47:47,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-10-14 17:47:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:47:47,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:47:47,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:47,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:47:47,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-14 17:47:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:47:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -495806874, now seen corresponding path program 1 times [2024-10-14 17:47:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:47:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640182784] [2024-10-14 17:47:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:47:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:47:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 17:47:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:47:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:47:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:47:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640182784] [2024-10-14 17:47:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640182784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:47:47,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:47:47,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:47:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823508952] [2024-10-14 17:47:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:47:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:47:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:47:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:47:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:47:47,910 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:47:47,990 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-10-14 17:47:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:47:47,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-10-14 17:47:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:47:47,991 INFO L225 Difference]: With dead ends: 47 [2024-10-14 17:47:47,991 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:47:47,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:47:47,991 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:47:47,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:47:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:47:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:47:47,992 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-14 17:47:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:47:47,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-10-14 17:47:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:47:47,992 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:47:47,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:47:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:47:47,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:47:47,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2024-10-14 17:47:47,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2024-10-14 17:47:47,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2024-10-14 17:47:47,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2024-10-14 17:47:48,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2024-10-14 17:47:48,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2024-10-14 17:47:48,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2024-10-14 17:47:48,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2024-10-14 17:47:48,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2024-10-14 17:47:48,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2024-10-14 17:47:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2024-10-14 17:47:48,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2024-10-14 17:47:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:47:48,006 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:47:48,007 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:47:48,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:47:48 BoogieIcfgContainer [2024-10-14 17:47:48,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:47:48,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:47:48,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:47:48,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:47:48,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:44" (3/4) ... [2024-10-14 17:47:48,011 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:47:48,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-10-14 17:47:48,019 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-10-14 17:47:48,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 17:47:48,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:47:48,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:47:48,078 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:47:48,078 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:47:48,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:47:48,079 INFO L158 Benchmark]: Toolchain (without parser) took 3988.27ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 93.8MB in the beginning and 98.8MB in the end (delta: -5.0MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,079 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 96.5MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:47:48,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.11ms. Allocated memory is still 159.4MB. Free memory was 93.3MB in the beginning and 122.3MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,079 INFO L158 Benchmark]: Boogie Preprocessor took 35.59ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 118.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,079 INFO L158 Benchmark]: RCFGBuilder took 353.26ms. Allocated memory is still 159.4MB. Free memory was 118.2MB in the beginning and 95.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,080 INFO L158 Benchmark]: TraceAbstraction took 3176.20ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 95.1MB in the beginning and 104.1MB in the end (delta: -9.0MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,080 INFO L158 Benchmark]: Witness Printer took 68.44ms. Allocated memory is still 232.8MB. Free memory was 104.1MB in the beginning and 98.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:47:48,081 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.58ms. Allocated memory is still 96.5MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.11ms. Allocated memory is still 159.4MB. Free memory was 93.3MB in the beginning and 122.3MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.59ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 118.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.26ms. Allocated memory is still 159.4MB. Free memory was 118.2MB in the beginning and 95.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3176.20ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 95.1MB in the beginning and 104.1MB in the end (delta: -9.0MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 68.44ms. Allocated memory is still 232.8MB. Free memory was 104.1MB in the beginning and 98.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: 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 2 procedures, 79 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 387 mSDtfsCounter, 690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 4/4 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 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:47:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE