./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/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.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:47:46,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:47:46,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-30 10:47:46,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:47:46,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:47:46,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:47:46,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:47:46,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:47:46,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:47:46,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:47:46,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:47:46,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:47:46,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:47:46,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:47:46,478 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:47:46,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:47:46,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:47:46,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:47:46,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:47:46,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:47:46,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:47:46,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:47:46,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-04-30 10:47:46,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:47:46,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:47:46,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:47:46,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:47:46,726 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:47:46,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-04-30 10:47:47,964 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047668ce0/321ba0aa13b94944b458ca2e7f57b742/FLAGeddff3938 [2025-04-30 10:47:48,233 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:47:48,234 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-04-30 10:47:48,244 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047668ce0/321ba0aa13b94944b458ca2e7f57b742/FLAGeddff3938 [2025-04-30 10:47:49,014 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047668ce0/321ba0aa13b94944b458ca2e7f57b742 [2025-04-30 10:47:49,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:47:49,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:47:49,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:47:49,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:47:49,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:47:49,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d71e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49, skipping insertion in model container [2025-04-30 10:47:49,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:47:49,289 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:47:49,297 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:47:49,351 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:47:49,371 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:47:49,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49 WrapperNode [2025-04-30 10:47:49,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:47:49,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:47:49,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:47:49,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:47:49,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,406 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2025-04-30 10:47:49,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:47:49,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:47:49,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:47:49,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:47:49,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,422 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [6, 5, 3, 3, 4]. 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, 3, 1, 1, 2]. [2025-04-30 10:47:49,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:47:49,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:47:49,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:47:49,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:47:49,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (1/1) ... [2025-04-30 10:47:49,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:47:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:47:49,466 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) [2025-04-30 10:47:49,470 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 [2025-04-30 10:47:49,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:47:49,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-04-30 10:47:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:47:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:47:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:47:49,568 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:47:49,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:47:49,786 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-04-30 10:47:49,789 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:47:49,795 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:47:49,796 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:47:49,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:47:49 BoogieIcfgContainer [2025-04-30 10:47:49,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:47:49,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:47:49,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:47:49,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:47:49,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:47:49" (1/3) ... [2025-04-30 10:47:49,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab367e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:47:49, skipping insertion in model container [2025-04-30 10:47:49,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:47:49" (2/3) ... [2025-04-30 10:47:49,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab367e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:47:49, skipping insertion in model container [2025-04-30 10:47:49,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:47:49" (3/3) ... [2025-04-30 10:47:49,805 INFO L128 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-04-30 10:47:49,814 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:47:49,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i that has 2 procedures, 89 locations, 99 edges, 1 initial locations, 2 loop locations, and 43 error locations. [2025-04-30 10:47:49,850 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:47:49,860 INFO L340 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;@51a694e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:47:49,861 INFO L341 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-04-30 10:47:49,863 INFO L278 IsEmpty]: Start isEmpty. Operand has 89 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 86 states have internal predecessors, (93), 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) [2025-04-30 10:47:49,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:47:49,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:49,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:47:49,868 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:49,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -32943826, now seen corresponding path program 1 times [2025-04-30 10:47:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:49,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434028400] [2025-04-30 10:47:49,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:49,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:47:49,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:47:49,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:49,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:50,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434028400] [2025-04-30 10:47:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434028400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468043085] [2025-04-30 10:47:50,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:50,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:50,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:50,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:50,282 INFO L87 Difference]: Start difference. First operand has 89 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 86 states have internal predecessors, (93), 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.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) [2025-04-30 10:47:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:50,378 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2025-04-30 10:47:50,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:50,380 INFO L79 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 [2025-04-30 10:47:50,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:50,385 INFO L225 Difference]: With dead ends: 86 [2025-04-30 10:47:50,385 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:47:50,387 INFO L436 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 [2025-04-30 10:47:50,390 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:50,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:47:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:47:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-30 10:47:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.097560975609756) internal successors, (86), 81 states have internal predecessors, (86), 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) [2025-04-30 10:47:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-04-30 10:47:50,423 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 6 [2025-04-30 10:47:50,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:50,423 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-04-30 10:47:50,423 INFO L486 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) [2025-04-30 10:47:50,423 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-04-30 10:47:50,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:47:50,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:50,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:47:50,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:47:50,424 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:50,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -32943825, now seen corresponding path program 1 times [2025-04-30 10:47:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:50,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266597612] [2025-04-30 10:47:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:50,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:47:50,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:47:50,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:50,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:50,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266597612] [2025-04-30 10:47:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266597612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:50,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:50,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599667518] [2025-04-30 10:47:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:50,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:50,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:50,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:50,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:50,595 INFO L87 Difference]: Start difference. First operand 84 states and 90 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) [2025-04-30 10:47:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:50,656 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-04-30 10:47:50,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:50,657 INFO L79 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 [2025-04-30 10:47:50,657 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:50,658 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:47:50,658 INFO L226 Difference]: Without dead ends: 81 [2025-04-30 10:47:50,658 INFO L436 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 [2025-04-30 10:47:50,658 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:50,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:47:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-30 10:47:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-04-30 10:47:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 41 states have (on average 2.024390243902439) internal successors, (83), 78 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) [2025-04-30 10:47:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-04-30 10:47:50,663 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 6 [2025-04-30 10:47:50,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:50,664 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-04-30 10:47:50,664 INFO L486 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) [2025-04-30 10:47:50,664 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-04-30 10:47:50,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:47:50,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:50,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:50,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:47:50,665 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:50,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1021258632, now seen corresponding path program 1 times [2025-04-30 10:47:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:50,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838500481] [2025-04-30 10:47:50,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:50,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:47:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:47:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:50,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838500481] [2025-04-30 10:47:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838500481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442098884] [2025-04-30 10:47:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:50,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:50,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:50,786 INFO L87 Difference]: Start difference. First operand 81 states and 87 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) [2025-04-30 10:47:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:50,853 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-04-30 10:47:50,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:50,853 INFO L79 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 [2025-04-30 10:47:50,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:50,854 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:47:50,854 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:47:50,854 INFO L436 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 [2025-04-30 10:47:50,855 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 65 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 49 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 [2025-04-30 10:47:50,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 49 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:47:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:47:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:47:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 74 states have internal predecessors, (79), 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) [2025-04-30 10:47:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-04-30 10:47:50,862 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2025-04-30 10:47:50,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:50,862 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-04-30 10:47:50,862 INFO L486 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) [2025-04-30 10:47:50,862 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-04-30 10:47:50,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:47:50,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:50,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:50,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:47:50,863 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:50,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1021258631, now seen corresponding path program 1 times [2025-04-30 10:47:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:50,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224635495] [2025-04-30 10:47:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:50,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:47:50,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:47:50,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:50,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:50,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224635495] [2025-04-30 10:47:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224635495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:50,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549720753] [2025-04-30 10:47:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:50,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:50,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:50,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:50,960 INFO L87 Difference]: Start difference. First operand 77 states and 83 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) [2025-04-30 10:47:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,007 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-04-30 10:47:51,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,008 INFO L79 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 [2025-04-30 10:47:51,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,009 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:47:51,009 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:47:51,009 INFO L436 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 [2025-04-30 10:47:51,009 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 51 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:47:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-04-30 10:47:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.829268292682927) internal successors, (75), 70 states have internal predecessors, (75), 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) [2025-04-30 10:47:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-04-30 10:47:51,016 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 7 [2025-04-30 10:47:51,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,016 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-04-30 10:47:51,016 INFO L486 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) [2025-04-30 10:47:51,016 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-04-30 10:47:51,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:47:51,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:47:51,016 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1594246543, now seen corresponding path program 1 times [2025-04-30 10:47:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365110554] [2025-04-30 10:47:51,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:47:51,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:47:51,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365110554] [2025-04-30 10:47:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365110554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690926314] [2025-04-30 10:47:51,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,100 INFO L87 Difference]: Start difference. First operand 73 states and 79 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) [2025-04-30 10:47:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,151 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-04-30 10:47:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,152 INFO L79 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 [2025-04-30 10:47:51,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,153 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:47:51,153 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:47:51,154 INFO L436 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 [2025-04-30 10:47:51,154 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 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 [2025-04-30 10:47:51,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:47:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-30 10:47:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7073170731707317) 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) [2025-04-30 10:47:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-04-30 10:47:51,160 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 8 [2025-04-30 10:47:51,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,160 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-04-30 10:47:51,160 INFO L486 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) [2025-04-30 10:47:51,160 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-04-30 10:47:51,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:47:51,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:47:51,160 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1594246542, now seen corresponding path program 1 times [2025-04-30 10:47:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597648892] [2025-04-30 10:47:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:47:51,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:47:51,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597648892] [2025-04-30 10:47:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597648892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784677085] [2025-04-30 10:47:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,267 INFO L87 Difference]: Start difference. First operand 68 states and 74 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) [2025-04-30 10:47:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,313 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-04-30 10:47:51,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,313 INFO L79 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 [2025-04-30 10:47:51,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,314 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:47:51,314 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:47:51,314 INFO L436 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 [2025-04-30 10:47:51,315 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:47:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:47:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 60 states have internal predecessors, (65), 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) [2025-04-30 10:47:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-04-30 10:47:51,320 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 8 [2025-04-30 10:47:51,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,322 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-04-30 10:47:51,322 INFO L486 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) [2025-04-30 10:47:51,322 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-04-30 10:47:51,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:47:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:47:51,323 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2117964699, now seen corresponding path program 1 times [2025-04-30 10:47:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889095217] [2025-04-30 10:47:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:47:51,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:47:51,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889095217] [2025-04-30 10:47:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889095217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806968824] [2025-04-30 10:47:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,383 INFO L87 Difference]: Start difference. First operand 63 states and 69 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) [2025-04-30 10:47:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,422 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-04-30 10:47:51,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,422 INFO L79 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 [2025-04-30 10:47:51,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,423 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:47:51,423 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:47:51,423 INFO L436 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 [2025-04-30 10:47:51,424 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 41 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 [2025-04-30 10:47:51,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:47:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:47:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 57 states have internal predecessors, (62), 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) [2025-04-30 10:47:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-04-30 10:47:51,427 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2025-04-30 10:47:51,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,427 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-04-30 10:47:51,428 INFO L486 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) [2025-04-30 10:47:51,428 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-04-30 10:47:51,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:47:51,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:47:51,428 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2117964700, now seen corresponding path program 1 times [2025-04-30 10:47:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62611721] [2025-04-30 10:47:51,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:47:51,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:47:51,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62611721] [2025-04-30 10:47:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62611721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353950612] [2025-04-30 10:47:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,526 INFO L87 Difference]: Start difference. First operand 60 states and 66 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) [2025-04-30 10:47:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,560 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-04-30 10:47:51,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,560 INFO L79 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 [2025-04-30 10:47:51,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,561 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:47:51,561 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:47:51,561 INFO L436 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 [2025-04-30 10:47:51,561 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 43 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:47:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-30 10:47:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 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) [2025-04-30 10:47:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-04-30 10:47:51,569 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 9 [2025-04-30 10:47:51,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,570 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-04-30 10:47:51,570 INFO L486 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) [2025-04-30 10:47:51,570 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-04-30 10:47:51,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:47:51,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:47:51,571 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1232396212, now seen corresponding path program 1 times [2025-04-30 10:47:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858377043] [2025-04-30 10:47:51,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:47:51,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:47:51,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858377043] [2025-04-30 10:47:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858377043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706617528] [2025-04-30 10:47:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,617 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-30 10:47:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,659 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-04-30 10:47:51,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,660 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-04-30 10:47:51,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,660 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:47:51,660 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:47:51,660 INFO L436 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 [2025-04-30 10:47:51,660 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 35 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 [2025-04-30 10:47:51,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:47:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-30 10:47:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2926829268292683) 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) [2025-04-30 10:47:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-04-30 10:47:51,662 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 10 [2025-04-30 10:47:51,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,662 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-04-30 10:47:51,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-30 10:47:51,663 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-04-30 10:47:51,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:47:51,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:47:51,663 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1232396213, now seen corresponding path program 1 times [2025-04-30 10:47:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034159883] [2025-04-30 10:47:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:47:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:47:51,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034159883] [2025-04-30 10:47:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034159883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:47:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348455273] [2025-04-30 10:47:51,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:47:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:47:51,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:47:51,721 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-30 10:47:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,751 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-04-30 10:47:51,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:47:51,752 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-04-30 10:47:51,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,752 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:47:51,752 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:47:51,752 INFO L436 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 [2025-04-30 10:47:51,753 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:47:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:47:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 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) [2025-04-30 10:47:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-04-30 10:47:51,756 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 10 [2025-04-30 10:47:51,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,756 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-04-30 10:47:51,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-30 10:47:51,756 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-04-30 10:47:51,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:47:51,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:51,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:47:51,757 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 975090773, now seen corresponding path program 1 times [2025-04-30 10:47:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260700055] [2025-04-30 10:47:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:47:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:47:51,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260700055] [2025-04-30 10:47:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260700055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:47:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910230733] [2025-04-30 10:47:51,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:47:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:47:51,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:47:51,812 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-04-30 10:47:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,831 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-04-30 10:47:51,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:47:51,832 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2025-04-30 10:47:51,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,832 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:47:51,832 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:47:51,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:47:51,833 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:47:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:47:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 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) [2025-04-30 10:47:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-30 10:47:51,834 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2025-04-30 10:47:51,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,834 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-30 10:47:51,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-04-30 10:47:51,835 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-30 10:47:51,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:47:51,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:51,835 INFO L218 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, 1] [2025-04-30 10:47:51,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:47:51,835 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:51,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1245311922, now seen corresponding path program 1 times [2025-04-30 10:47:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:51,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253489975] [2025-04-30 10:47:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:47:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:47:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:51,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253489975] [2025-04-30 10:47:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253489975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:47:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557671898] [2025-04-30 10:47:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:51,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:47:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:47:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:47:51,953 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-30 10:47:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:51,990 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-30 10:47:51,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:47:51,990 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2025-04-30 10:47:51,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:51,991 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:47:51,991 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:47:51,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:47:51,991 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:51,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 160 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:47:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2025-04-30 10:47:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 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) [2025-04-30 10:47:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-04-30 10:47:51,998 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 23 [2025-04-30 10:47:51,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:51,998 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-04-30 10:47:51,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-30 10:47:51,998 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-04-30 10:47:51,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:47:52,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:52,000 INFO L218 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, 1, 1, 1] [2025-04-30 10:47:52,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:47:52,000 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:52,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1275764369, now seen corresponding path program 1 times [2025-04-30 10:47:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:52,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120380462] [2025-04-30 10:47:52,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:52,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:47:52,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:47:52,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:52,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120380462] [2025-04-30 10:47:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120380462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:52,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:52,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:47:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262672389] [2025-04-30 10:47:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:52,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:47:52,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:52,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:47:52,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:47:52,095 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-30 10:47:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:52,127 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2025-04-30 10:47:52,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:47:52,128 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 25 [2025-04-30 10:47:52,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:52,128 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:47:52,128 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:47:52,129 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:47:52,129 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:52,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:47:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:47:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2025-04-30 10:47:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 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) [2025-04-30 10:47:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-04-30 10:47:52,131 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 25 [2025-04-30 10:47:52,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:52,131 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-04-30 10:47:52,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-30 10:47:52,135 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-04-30 10:47:52,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:47:52,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:52,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:52,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:47:52,136 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-30 10:47:52,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 994517052, now seen corresponding path program 1 times [2025-04-30 10:47:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:52,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739845708] [2025-04-30 10:47:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:47:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:47:52,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:47:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:52,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739845708] [2025-04-30 10:47:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739845708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:47:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:47:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:47:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844459687] [2025-04-30 10:47:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:47:52,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:47:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:52,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:47:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:47:52,960 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2025-04-30 10:47:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:53,033 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2025-04-30 10:47:53,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:47:53,033 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 37 [2025-04-30 10:47:53,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:53,034 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:47:53,034 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:47:53,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:47:53,035 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:53,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 67 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:47:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:47:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:47:53,036 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) [2025-04-30 10:47:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:47:53,036 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-04-30 10:47:53,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:53,036 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:47:53,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2025-04-30 10:47:53,036 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:47:53,036 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2025-04-30 10:47:53,038 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2025-04-30 10:47:53,039 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2025-04-30 10:47:53,040 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2025-04-30 10:47:53,041 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2025-04-30 10:47:53,042 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2025-04-30 10:47:53,042 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2025-04-30 10:47:53,042 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2025-04-30 10:47:53,043 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2025-04-30 10:47:53,043 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2025-04-30 10:47:53,043 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2025-04-30 10:47:53,043 INFO L790 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2025-04-30 10:47:53,043 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2025-04-30 10:47:53,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:47:53,045 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:53,046 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:47:53,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:47:53 BoogieIcfgContainer [2025-04-30 10:47:53,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:47:53,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:47:53,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:47:53,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:47:53,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:47:49" (3/4) ... [2025-04-30 10:47:53,052 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:47:53,056 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2025-04-30 10:47:53,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-04-30 10:47:53,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-04-30 10:47:53,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:47:53,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:47:53,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:47:53,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:47:53,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:47:53,115 INFO L158 Benchmark]: Toolchain (without parser) took 4098.41ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 109.5MB in the beginning and 225.8MB in the end (delta: -116.2MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.54ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 90.0MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: Boogie Preprocessor took 35.83ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: RCFGBuilder took 353.08ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 66.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: TraceAbstraction took 3250.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 65.2MB in the beginning and 231.0MB in the end (delta: -165.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:53,116 INFO L158 Benchmark]: Witness Printer took 65.64ms. Allocated memory is still 285.2MB. Free memory was 231.0MB in the beginning and 225.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:47:53,117 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.54ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 90.0MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.83ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.08ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 66.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3250.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 65.2MB in the beginning and 231.0MB in the end (delta: -165.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.64ms. Allocated memory is still 285.2MB. Free memory was 231.0MB in the beginning and 225.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. 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, 89 locations, 99 edges, 43 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 655 mSDsluCounter, 948 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 546 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 49, 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, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 2366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6/6 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:47:53,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE