./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe025_power.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for memory safety (deref-memtrack)
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-12 16:12:20,446 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-12 16:12:20,525 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-12 16:12:20,531 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-12 16:12:20,532 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-12 16:12:20,565 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-12 16:12:20,566 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-12 16:12:20,567 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-12 16:12:20,567 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-12 16:12:20,569 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-12 16:12:20,569 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-12 16:12:20,570 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-12 16:12:20,570 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-12 16:12:20,572 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-12 16:12:20,572 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-12 16:12:20,573 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-12 16:12:20,573 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-12 16:12:20,573 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-12 16:12:20,573 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-12 16:12:20,573 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-12 16:12:20,574 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-12 16:12:20,576 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-12 16:12:20,577 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-12 16:12:20,577 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-12 16:12:20,577 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-12 16:12:20,577 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-12 16:12:20,577 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-12 16:12:20,578 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-12 16:12:20,578 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-12 16:12:20,578 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-12 16:12:20,579 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-12 16:12:20,579 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-12 16:12:20,579 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-12 16:12:20,579 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 16:12:20,579 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-12 16:12:20,580 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-12 16:12:20,580 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-12 16:12:20,580 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-12 16:12:20,580 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-12 16:12:20,580 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-12 16:12:20,581 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-12 16:12:20,582 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-12 16:12:20,582 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6
[2024-11-12 16:12:20,835 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-12 16:12:20,861 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-12 16:12:20,865 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-12 16:12:20,866 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-12 16:12:20,867 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-12 16:12:20,868 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe025_power.i
[2024-11-12 16:12:22,329 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-12 16:12:22,571 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-12 16:12:22,572 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe025_power.i
[2024-11-12 16:12:22,586 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8372e58d/62849ea321804067ad67f83b864c5e76/FLAGcb1d5414e
[2024-11-12 16:12:22,891 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8372e58d/62849ea321804067ad67f83b864c5e76
[2024-11-12 16:12:22,894 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-12 16:12:22,895 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-12 16:12:22,896 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-12 16:12:22,896 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-12 16:12:22,902 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-12 16:12:22,903 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:22" (1/1) ...
[2024-11-12 16:12:22,904 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebd428f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:22, skipping insertion in model container
[2024-11-12 16:12:22,904 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:22" (1/1) ...
[2024-11-12 16:12:22,959 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-12 16:12:23,377 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 16:12:23,392 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-12 16:12:23,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 16:12:23,537 INFO  L204         MainTranslator]: Completed translation
[2024-11-12 16:12:23,537 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23 WrapperNode
[2024-11-12 16:12:23,538 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-12 16:12:23,539 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-12 16:12:23,539 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-12 16:12:23,540 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-12 16:12:23,547 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,572 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,642 INFO  L138                Inliner]: procedures = 175, calls = 75, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 225
[2024-11-12 16:12:23,643 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-12 16:12:23,643 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-12 16:12:23,647 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-12 16:12:23,647 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-12 16:12:23,661 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,665 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,672 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,736 INFO  L175           MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9].
[2024-11-12 16:12:23,740 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,740 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,756 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,759 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,762 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,764 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,768 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-12 16:12:23,769 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-12 16:12:23,769 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-12 16:12:23,769 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-12 16:12:23,770 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (1/1) ...
[2024-11-12 16:12:23,779 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 16:12:23,790 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 16:12:23,807 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:23,813 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-12 16:12:23,857 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-12 16:12:23,858 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-12 16:12:23,859 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-12 16:12:23,859 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-12 16:12:23,859 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-12 16:12:23,859 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-12 16:12:23,859 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-12 16:12:23,859 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-12 16:12:23,860 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-12 16:12:23,860 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-12 16:12:23,860 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-12 16:12:23,860 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-12 16:12:23,862 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-12 16:12:24,043 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-12 16:12:24,045 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-12 16:12:24,666 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-12 16:12:24,666 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-12 16:12:25,580 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-12 16:12:25,581 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-12 16:12:25,582 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:25 BoogieIcfgContainer
[2024-11-12 16:12:25,582 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-12 16:12:25,584 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-12 16:12:25,585 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-12 16:12:25,589 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-12 16:12:25,590 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:12:22" (1/3) ...
[2024-11-12 16:12:25,590 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f3e106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:25, skipping insertion in model container
[2024-11-12 16:12:25,591 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:23" (2/3) ...
[2024-11-12 16:12:25,592 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f3e106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:25, skipping insertion in model container
[2024-11-12 16:12:25,592 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:25" (3/3) ...
[2024-11-12 16:12:25,593 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe025_power.i
[2024-11-12 16:12:25,612 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-12 16:12:25,612 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations.
[2024-11-12 16:12:25,612 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-12 16:12:25,819 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-12 16:12:25,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 212 flow
[2024-11-12 16:12:25,936 INFO  L124   PetriNetUnfolderBase]: 2/97 cut-off events.
[2024-11-12 16:12:25,936 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:25,945 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 470 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. 
[2024-11-12 16:12:25,946 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 212 flow
[2024-11-12 16:12:25,952 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow
[2024-11-12 16:12:25,961 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-12 16:12:25,968 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36855a88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-12 16:12:25,968 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 99 error locations.
[2024-11-12 16:12:25,973 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-12 16:12:25,973 INFO  L124   PetriNetUnfolderBase]: 0/9 cut-off events.
[2024-11-12 16:12:25,973 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:25,974 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:25,974 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:25,975 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:25,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:25,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 308317437, now seen corresponding path program 1 times
[2024-11-12 16:12:25,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 16:12:25,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869961010]
[2024-11-12 16:12:25,991 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:25,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 16:12:26,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:26,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:26,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 16:12:26,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869961010]
[2024-11-12 16:12:26,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869961010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:26,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:26,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:26,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396482702]
[2024-11-12 16:12:26,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:26,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:26,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 16:12:26,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:26,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:26,441 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:26,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 203 flow. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:26,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:26,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:26,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:29,854 INFO  L124   PetriNetUnfolderBase]: 8679/13573 cut-off events.
[2024-11-12 16:12:29,855 INFO  L125   PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES.
[2024-11-12 16:12:29,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25948 conditions, 13573 events. 8679/13573 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 113561 event pairs, 8679 based on Foata normal form. 504/8654 useless extension candidates. Maximal degree in co-relation 25937. Up to 12288 conditions per place. 
[2024-11-12 16:12:30,058 INFO  L140   encePairwiseOnDemand]: 54/100 looper letters, 35 selfloop transitions, 1 changer transitions 0/51 dead transitions.
[2024-11-12 16:12:30,058 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 183 flow
[2024-11-12 16:12:30,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:30,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:30,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions.
[2024-11-12 16:12:30,071 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-11-12 16:12:30,074 INFO  L175             Difference]: Start difference. First operand has 105 places, 97 transitions, 203 flow. Second operand 3 states and 135 transitions.
[2024-11-12 16:12:30,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 183 flow
[2024-11-12 16:12:30,079 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-12 16:12:30,084 INFO  L231             Difference]: Finished difference. Result has 60 places, 51 transitions, 110 flow
[2024-11-12 16:12:30,086 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=51}
[2024-11-12 16:12:30,092 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places.
[2024-11-12 16:12:30,093 INFO  L471      AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 110 flow
[2024-11-12 16:12:30,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:30,093 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:30,093 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:30,093 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-12 16:12:30,094 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:30,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:30,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 308287229, now seen corresponding path program 1 times
[2024-11-12 16:12:30,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 16:12:30,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662754698]
[2024-11-12 16:12:30,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:30,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 16:12:30,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:30,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:30,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 16:12:30,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662754698]
[2024-11-12 16:12:30,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662754698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:30,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:30,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:30,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730202539]
[2024-11-12 16:12:30,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:30,276 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:30,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 16:12:30,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:30,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:30,278 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:30,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 110 flow. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:30,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:30,278 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:30,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:32,723 INFO  L124   PetriNetUnfolderBase]: 7671/11441 cut-off events.
[2024-11-12 16:12:32,724 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:32,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22399 conditions, 11441 events. 7671/11441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 93409 event pairs, 615 based on Foata normal form. 0/6958 useless extension candidates. Maximal degree in co-relation 22393. Up to 9857 conditions per place. 
[2024-11-12 16:12:32,812 INFO  L140   encePairwiseOnDemand]: 97/100 looper letters, 57 selfloop transitions, 2 changer transitions 0/74 dead transitions.
[2024-11-12 16:12:32,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 276 flow
[2024-11-12 16:12:32,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:32,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:32,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2024-11-12 16:12:32,817 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.38
[2024-11-12 16:12:32,817 INFO  L175             Difference]: Start difference. First operand has 60 places, 51 transitions, 110 flow. Second operand 3 states and 114 transitions.
[2024-11-12 16:12:32,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 276 flow
[2024-11-12 16:12:32,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-12 16:12:32,821 INFO  L231             Difference]: Finished difference. Result has 60 places, 50 transitions, 111 flow
[2024-11-12 16:12:32,821 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=60, PETRI_TRANSITIONS=50}
[2024-11-12 16:12:32,822 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places.
[2024-11-12 16:12:32,822 INFO  L471      AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 111 flow
[2024-11-12 16:12:32,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:32,823 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:32,823 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:32,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-12 16:12:32,824 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:32,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:32,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 308317438, now seen corresponding path program 1 times
[2024-11-12 16:12:32,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 16:12:32,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92904907]
[2024-11-12 16:12:32,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:32,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 16:12:32,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:32,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:32,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 16:12:32,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92904907]
[2024-11-12 16:12:32,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92904907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:32,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:32,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:32,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304927486]
[2024-11-12 16:12:32,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:32,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:32,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 16:12:32,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:32,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:32,966 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:32,966 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 111 flow. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:32,966 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:32,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:32,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:33,718 INFO  L124   PetriNetUnfolderBase]: 1769/3008 cut-off events.
[2024-11-12 16:12:33,719 INFO  L125   PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES.
[2024-11-12 16:12:33,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5799 conditions, 3008 events. 1769/3008 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21517 event pairs, 1769 based on Foata normal form. 0/2673 useless extension candidates. Maximal degree in co-relation 5792. Up to 2604 conditions per place. 
[2024-11-12 16:12:33,737 INFO  L140   encePairwiseOnDemand]: 90/100 looper letters, 25 selfloop transitions, 1 changer transitions 0/41 dead transitions.
[2024-11-12 16:12:33,737 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 145 flow
[2024-11-12 16:12:33,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:33,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:33,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions.
[2024-11-12 16:12:33,741 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.2966666666666667
[2024-11-12 16:12:33,742 INFO  L175             Difference]: Start difference. First operand has 60 places, 50 transitions, 111 flow. Second operand 3 states and 89 transitions.
[2024-11-12 16:12:33,742 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 145 flow
[2024-11-12 16:12:33,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-12 16:12:33,743 INFO  L231             Difference]: Finished difference. Result has 51 places, 41 transitions, 91 flow
[2024-11-12 16:12:33,744 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=51, PETRI_TRANSITIONS=41}
[2024-11-12 16:12:33,745 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -54 predicate places.
[2024-11-12 16:12:33,745 INFO  L471      AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 91 flow
[2024-11-12 16:12:33,746 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:33,746 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:33,746 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:33,746 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-12 16:12:33,746 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:33,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:33,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 966970760, now seen corresponding path program 1 times
[2024-11-12 16:12:33,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 16:12:33,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039254563]
[2024-11-12 16:12:33,748 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:33,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 16:12:33,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 16:12:33,781 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 16:12:33,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 16:12:33,834 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 16:12:33,835 INFO  L339         BasicCegarLoop]: Counterexample is feasible
[2024-11-12 16:12:33,836 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (98 of 99 remaining)
[2024-11-12 16:12:33,838 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining)
[2024-11-12 16:12:33,839 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining)
[2024-11-12 16:12:33,839 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining)
[2024-11-12 16:12:33,839 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining)
[2024-11-12 16:12:33,840 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining)
[2024-11-12 16:12:33,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining)
[2024-11-12 16:12:33,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining)
[2024-11-12 16:12:33,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining)
[2024-11-12 16:12:33,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining)
[2024-11-12 16:12:33,841 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining)
[2024-11-12 16:12:33,842 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining)
[2024-11-12 16:12:33,842 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining)
[2024-11-12 16:12:33,842 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (85 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (84 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining)
[2024-11-12 16:12:33,843 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining)
[2024-11-12 16:12:33,844 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining)
[2024-11-12 16:12:33,845 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining)
[2024-11-12 16:12:33,845 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining)
[2024-11-12 16:12:33,845 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining)
[2024-11-12 16:12:33,845 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining)
[2024-11-12 16:12:33,846 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining)
[2024-11-12 16:12:33,847 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining)
[2024-11-12 16:12:33,847 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining)
[2024-11-12 16:12:33,847 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining)
[2024-11-12 16:12:33,848 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining)
[2024-11-12 16:12:33,850 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining)
[2024-11-12 16:12:33,850 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining)
[2024-11-12 16:12:33,850 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining)
[2024-11-12 16:12:33,850 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining)
[2024-11-12 16:12:33,851 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining)
[2024-11-12 16:12:33,852 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining)
[2024-11-12 16:12:33,853 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (41 of 99 remaining)
[2024-11-12 16:12:33,854 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (40 of 99 remaining)
[2024-11-12 16:12:33,854 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 99 remaining)
[2024-11-12 16:12:33,854 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining)
[2024-11-12 16:12:33,854 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining)
[2024-11-12 16:12:33,854 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining)
[2024-11-12 16:12:33,855 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining)
[2024-11-12 16:12:33,856 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining)
[2024-11-12 16:12:33,856 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining)
[2024-11-12 16:12:33,856 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 99 remaining)
[2024-11-12 16:12:33,856 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining)
[2024-11-12 16:12:33,859 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining)
[2024-11-12 16:12:33,859 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining)
[2024-11-12 16:12:33,860 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining)
[2024-11-12 16:12:33,861 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining)
[2024-11-12 16:12:33,862 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining)
[2024-11-12 16:12:33,862 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining)
[2024-11-12 16:12:33,862 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining)
[2024-11-12 16:12:33,862 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-12 16:12:33,862 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-12 16:12:33,914 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-12 16:12:33,914 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-12 16:12:33,921 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:12:33 BasicIcfg
[2024-11-12 16:12:33,923 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-12 16:12:33,924 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-12 16:12:33,924 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-12 16:12:33,925 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-12 16:12:33,925 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:25" (3/4) ...
[2024-11-12 16:12:33,927 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-12 16:12:33,928 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-12 16:12:33,929 INFO  L158              Benchmark]: Toolchain (without parser) took 11034.35ms. Allocated memory was 155.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 83.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 504.4MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,929 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-12 16:12:33,930 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 642.84ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 53.2MB in the end (delta: 29.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,930 INFO  L158              Benchmark]: Boogie Procedure Inliner took 103.69ms. Allocated memory is still 155.2MB. Free memory was 53.2MB in the beginning and 123.6MB in the end (delta: -70.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,930 INFO  L158              Benchmark]: Boogie Preprocessor took 125.00ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 118.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,930 INFO  L158              Benchmark]: RCFGBuilder took 1813.02ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 118.0MB in the beginning and 98.7MB in the end (delta: 19.3MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,931 INFO  L158              Benchmark]: TraceAbstraction took 8338.67ms. Allocated memory was 203.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 97.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 468.9MB. Max. memory is 16.1GB.
[2024-11-12 16:12:33,931 INFO  L158              Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-12 16:12:33,932 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.16ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 642.84ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 53.2MB in the end (delta: 29.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 103.69ms. Allocated memory is still 155.2MB. Free memory was 53.2MB in the beginning and 123.6MB in the end (delta: -70.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 125.00ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 118.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1813.02ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 118.0MB in the beginning and 98.7MB in the end (delta: 19.3MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8338.67ms. Allocated memory was 203.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 97.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 468.9MB. Max. memory is 16.1GB.
 * Witness Printer took 4.80ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L715]               0  _Bool __unbuffered_p2_EAX$flush_delayed;
[L716]               0  int __unbuffered_p2_EAX$mem_tmp;
[L717]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd0;
[L718]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd1;
[L719]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd2;
[L720]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd3;
[L721]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p2_EAX$read_delayed;
[L726]               0  int *__unbuffered_p2_EAX$read_delayed_var;
[L727]               0  int __unbuffered_p2_EAX$w_buff0;
[L728]               0  _Bool __unbuffered_p2_EAX$w_buff0_used;
[L729]               0  int __unbuffered_p2_EAX$w_buff1;
[L730]               0  _Bool __unbuffered_p2_EAX$w_buff1_used;
[L732]               0  int __unbuffered_p2_EBX = 0;
[L733]               0  _Bool main$tmp_guard0;
[L734]               0  _Bool main$tmp_guard1;
[L736]               0  int x = 0;
[L736]               0  int x = 0;
[L737]               0  _Bool x$flush_delayed;
[L738]               0  int x$mem_tmp;
[L739]               0  _Bool x$r_buff0_thd0;
[L740]               0  _Bool x$r_buff0_thd1;
[L741]               0  _Bool x$r_buff0_thd2;
[L742]               0  _Bool x$r_buff0_thd3;
[L743]               0  _Bool x$r_buff1_thd0;
[L744]               0  _Bool x$r_buff1_thd1;
[L745]               0  _Bool x$r_buff1_thd2;
[L746]               0  _Bool x$r_buff1_thd3;
[L747]               0  _Bool x$read_delayed;
[L748]               0  int *x$read_delayed_var;
[L749]               0  int x$w_buff0;
[L750]               0  _Bool x$w_buff0_used;
[L751]               0  int x$w_buff1;
[L752]               0  _Bool x$w_buff1_used;
[L754]               0  int y = 0;
[L755]               0  _Bool weak$$choice0;
[L756]               0  _Bool weak$$choice1;
[L757]               0  _Bool weak$$choice2;
[L873]               0  pthread_t t2369;
[L874]  FCALL, FORK  0  pthread_create(&t2369, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L875]               0  pthread_t t2370;
[L876]  FCALL, FORK  0  pthread_create(&t2370, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, t2370=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L791]               2  x$w_buff1 = x$w_buff0
[L792]               2  x$w_buff0 = 1
[L793]               2  x$w_buff1_used = x$w_buff0_used
[L794]               2  x$w_buff0_used = (_Bool)1
[L795]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L795]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L796]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L797]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L798]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L799]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L800]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L803]               2  x$w_buff1 = x$w_buff0
[L804]               2  x$w_buff0 = 2
[L805]               2  x$w_buff1_used = x$w_buff0_used
[L806]               2  x$w_buff0_used = (_Bool)1
[L807]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND TRUE    2  !expression
[L19]   CALL         2  reach_error()
[L18]   COND FALSE   2  !(0)
[L18]                2  __assert_fail ("0", "safe025_power.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0]

  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 162 locations, 99 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 0 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-12 16:12:33,971 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-12 16:12:36,337 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-12 16:12:36,423 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-12 16:12:36,431 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-12 16:12:36,432 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-12 16:12:36,464 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-12 16:12:36,465 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-12 16:12:36,465 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-12 16:12:36,466 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-12 16:12:36,467 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-12 16:12:36,468 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-12 16:12:36,469 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-12 16:12:36,469 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-12 16:12:36,470 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-12 16:12:36,470 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-12 16:12:36,473 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-12 16:12:36,473 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-12 16:12:36,474 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-12 16:12:36,474 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-12 16:12:36,474 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-12 16:12:36,475 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-12 16:12:36,475 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-12 16:12:36,475 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-12 16:12:36,475 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-12 16:12:36,476 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-12 16:12:36,476 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-12 16:12:36,476 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-12 16:12:36,476 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-12 16:12:36,477 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-12 16:12:36,477 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-12 16:12:36,477 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-12 16:12:36,477 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-12 16:12:36,477 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-12 16:12:36,478 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-12 16:12:36,478 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-12 16:12:36,478 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 16:12:36,479 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-12 16:12:36,479 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-12 16:12:36,479 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-12 16:12:36,480 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-12 16:12:36,480 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-12 16:12:36,481 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-12 16:12:36,481 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-12 16:12:36,482 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-12 16:12:36,482 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6
[2024-11-12 16:12:36,812 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-12 16:12:36,832 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-12 16:12:36,836 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-12 16:12:36,837 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-12 16:12:36,837 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-12 16:12:36,838 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe025_power.i
[2024-11-12 16:12:38,364 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-12 16:12:38,633 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-12 16:12:38,634 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe025_power.i
[2024-11-12 16:12:38,654 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2747c100a/f17517bcbc184bdaa0ba0ca414504a9e/FLAG2a49138d2
[2024-11-12 16:12:38,671 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2747c100a/f17517bcbc184bdaa0ba0ca414504a9e
[2024-11-12 16:12:38,674 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-12 16:12:38,676 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-12 16:12:38,679 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-12 16:12:38,680 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-12 16:12:38,685 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-12 16:12:38,685 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:38" (1/1) ...
[2024-11-12 16:12:38,686 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77293ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:38, skipping insertion in model container
[2024-11-12 16:12:38,687 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:38" (1/1) ...
[2024-11-12 16:12:38,747 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-12 16:12:39,206 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 16:12:39,223 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-12 16:12:39,292 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 16:12:39,339 INFO  L204         MainTranslator]: Completed translation
[2024-11-12 16:12:39,339 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39 WrapperNode
[2024-11-12 16:12:39,340 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-12 16:12:39,341 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-12 16:12:39,341 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-12 16:12:39,341 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-12 16:12:39,347 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,376 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,410 INFO  L138                Inliner]: procedures = 179, calls = 75, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 226
[2024-11-12 16:12:39,410 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-12 16:12:39,411 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-12 16:12:39,411 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-12 16:12:39,411 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-12 16:12:39,426 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,426 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,431 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,460 INFO  L175           MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9].
[2024-11-12 16:12:39,461 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,461 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,475 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,479 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,482 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,496 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,502 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-12 16:12:39,503 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-12 16:12:39,503 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-12 16:12:39,503 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-12 16:12:39,504 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (1/1) ...
[2024-11-12 16:12:39,515 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 16:12:39,532 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 16:12:39,550 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:39,557 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-12 16:12:39,607 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-12 16:12:39,608 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-12 16:12:39,609 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-12 16:12:39,609 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2024-11-12 16:12:39,610 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2024-11-12 16:12:39,610 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-12 16:12:39,610 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-12 16:12:39,611 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-12 16:12:39,611 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-12 16:12:39,611 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-12 16:12:39,611 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-12 16:12:39,611 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-12 16:12:39,611 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-12 16:12:39,611 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-12 16:12:39,613 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-12 16:12:39,824 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-12 16:12:39,827 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-12 16:12:40,692 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-12 16:12:40,693 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-12 16:12:41,725 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-12 16:12:41,726 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-12 16:12:41,726 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:41 BoogieIcfgContainer
[2024-11-12 16:12:41,726 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-12 16:12:41,728 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-12 16:12:41,728 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-12 16:12:41,731 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-12 16:12:41,731 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:12:38" (1/3) ...
[2024-11-12 16:12:41,732 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4294e793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:41, skipping insertion in model container
[2024-11-12 16:12:41,732 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:39" (2/3) ...
[2024-11-12 16:12:41,732 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4294e793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:41, skipping insertion in model container
[2024-11-12 16:12:41,733 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:41" (3/3) ...
[2024-11-12 16:12:41,734 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe025_power.i
[2024-11-12 16:12:41,761 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-12 16:12:41,762 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations.
[2024-11-12 16:12:41,762 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-12 16:12:41,991 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-12 16:12:42,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 212 flow
[2024-11-12 16:12:42,117 INFO  L124   PetriNetUnfolderBase]: 2/97 cut-off events.
[2024-11-12 16:12:42,118 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:42,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 469 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. 
[2024-11-12 16:12:42,125 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 212 flow
[2024-11-12 16:12:42,130 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow
[2024-11-12 16:12:42,145 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-12 16:12:42,154 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@571fafbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-12 16:12:42,154 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 99 error locations.
[2024-11-12 16:12:42,160 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-12 16:12:42,160 INFO  L124   PetriNetUnfolderBase]: 0/9 cut-off events.
[2024-11-12 16:12:42,160 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:42,161 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:42,161 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:42,162 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:42,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:42,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 369331391, now seen corresponding path program 1 times
[2024-11-12 16:12:42,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-12 16:12:42,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913225348]
[2024-11-12 16:12:42,180 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:42,181 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:42,181 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-12 16:12:42,184 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:42,186 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-12 16:12:42,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:42,363 INFO  L256         TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-12 16:12:42,367 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 16:12:42,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:42,436 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-12 16:12:42,436 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-12 16:12:42,437 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913225348]
[2024-11-12 16:12:42,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913225348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:42,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:42,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:42,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292470826]
[2024-11-12 16:12:42,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:42,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:42,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-12 16:12:42,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:42,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:42,479 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:42,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 203 flow. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:42,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:42,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:42,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:45,811 INFO  L124   PetriNetUnfolderBase]: 8679/13573 cut-off events.
[2024-11-12 16:12:45,811 INFO  L125   PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES.
[2024-11-12 16:12:45,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25948 conditions, 13573 events. 8679/13573 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 114285 event pairs, 8679 based on Foata normal form. 504/8654 useless extension candidates. Maximal degree in co-relation 25937. Up to 12288 conditions per place. 
[2024-11-12 16:12:45,916 INFO  L140   encePairwiseOnDemand]: 54/100 looper letters, 35 selfloop transitions, 1 changer transitions 0/51 dead transitions.
[2024-11-12 16:12:45,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 183 flow
[2024-11-12 16:12:45,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:45,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:45,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions.
[2024-11-12 16:12:45,928 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-11-12 16:12:45,929 INFO  L175             Difference]: Start difference. First operand has 105 places, 97 transitions, 203 flow. Second operand 3 states and 135 transitions.
[2024-11-12 16:12:45,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 183 flow
[2024-11-12 16:12:45,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-12 16:12:45,936 INFO  L231             Difference]: Finished difference. Result has 60 places, 51 transitions, 110 flow
[2024-11-12 16:12:45,938 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=51}
[2024-11-12 16:12:45,942 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places.
[2024-11-12 16:12:45,943 INFO  L471      AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 110 flow
[2024-11-12 16:12:45,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:45,943 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:45,943 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:45,948 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-12 16:12:46,144 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:46,145 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:46,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:46,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 369297339, now seen corresponding path program 1 times
[2024-11-12 16:12:46,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-12 16:12:46,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169110582]
[2024-11-12 16:12:46,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:46,147 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:46,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-12 16:12:46,148 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:46,149 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-12 16:12:46,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:46,342 INFO  L256         TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-12 16:12:46,343 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 16:12:46,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:46,359 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-12 16:12:46,359 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-12 16:12:46,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169110582]
[2024-11-12 16:12:46,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169110582] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:46,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:46,360 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:46,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270304336]
[2024-11-12 16:12:46,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:46,362 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:46,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-12 16:12:46,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:46,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:46,364 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:46,364 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 110 flow. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:46,365 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:46,365 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:46,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:48,880 INFO  L124   PetriNetUnfolderBase]: 7671/11441 cut-off events.
[2024-11-12 16:12:48,881 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-12 16:12:48,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22399 conditions, 11441 events. 7671/11441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 93894 event pairs, 615 based on Foata normal form. 0/6958 useless extension candidates. Maximal degree in co-relation 22393. Up to 9857 conditions per place. 
[2024-11-12 16:12:48,962 INFO  L140   encePairwiseOnDemand]: 97/100 looper letters, 57 selfloop transitions, 2 changer transitions 0/74 dead transitions.
[2024-11-12 16:12:48,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 276 flow
[2024-11-12 16:12:48,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:48,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:48,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2024-11-12 16:12:48,964 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.38
[2024-11-12 16:12:48,964 INFO  L175             Difference]: Start difference. First operand has 60 places, 51 transitions, 110 flow. Second operand 3 states and 114 transitions.
[2024-11-12 16:12:48,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 276 flow
[2024-11-12 16:12:48,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-12 16:12:48,967 INFO  L231             Difference]: Finished difference. Result has 60 places, 50 transitions, 111 flow
[2024-11-12 16:12:48,967 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=60, PETRI_TRANSITIONS=50}
[2024-11-12 16:12:48,968 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places.
[2024-11-12 16:12:48,968 INFO  L471      AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 111 flow
[2024-11-12 16:12:48,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:48,969 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:48,969 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:48,974 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-12 16:12:49,170 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:49,171 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:49,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:49,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 369331392, now seen corresponding path program 1 times
[2024-11-12 16:12:49,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-12 16:12:49,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302055120]
[2024-11-12 16:12:49,172 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:49,172 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:49,172 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-12 16:12:49,176 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:49,178 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-12 16:12:49,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 16:12:49,314 INFO  L256         TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-12 16:12:49,315 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 16:12:49,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-12 16:12:49,385 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-12 16:12:49,385 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-12 16:12:49,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302055120]
[2024-11-12 16:12:49,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [302055120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 16:12:49,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 16:12:49,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-12 16:12:49,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029736141]
[2024-11-12 16:12:49,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 16:12:49,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-12 16:12:49,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-12 16:12:49,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-12 16:12:49,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-12 16:12:49,388 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 100
[2024-11-12 16:12:49,388 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 111 flow. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:49,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-12 16:12:49,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 100
[2024-11-12 16:12:49,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-12 16:12:50,238 INFO  L124   PetriNetUnfolderBase]: 1769/3008 cut-off events.
[2024-11-12 16:12:50,238 INFO  L125   PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES.
[2024-11-12 16:12:50,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5799 conditions, 3008 events. 1769/3008 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21624 event pairs, 1769 based on Foata normal form. 0/2673 useless extension candidates. Maximal degree in co-relation 5792. Up to 2604 conditions per place. 
[2024-11-12 16:12:50,258 INFO  L140   encePairwiseOnDemand]: 90/100 looper letters, 25 selfloop transitions, 1 changer transitions 0/41 dead transitions.
[2024-11-12 16:12:50,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 145 flow
[2024-11-12 16:12:50,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-12 16:12:50,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-12 16:12:50,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions.
[2024-11-12 16:12:50,261 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.2966666666666667
[2024-11-12 16:12:50,261 INFO  L175             Difference]: Start difference. First operand has 60 places, 50 transitions, 111 flow. Second operand 3 states and 89 transitions.
[2024-11-12 16:12:50,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 145 flow
[2024-11-12 16:12:50,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-12 16:12:50,263 INFO  L231             Difference]: Finished difference. Result has 51 places, 41 transitions, 91 flow
[2024-11-12 16:12:50,264 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=51, PETRI_TRANSITIONS=41}
[2024-11-12 16:12:50,264 INFO  L279   CegarLoopForPetriNet]: 105 programPoint places, -54 predicate places.
[2024-11-12 16:12:50,264 INFO  L471      AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 91 flow
[2024-11-12 16:12:50,265 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-12 16:12:50,265 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2024-11-12 16:12:50,265 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-12 16:12:50,270 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-12 16:12:50,465 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:50,466 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] ===
[2024-11-12 16:12:50,467 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 16:12:50,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -1436683124, now seen corresponding path program 1 times
[2024-11-12 16:12:50,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-12 16:12:50,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335251775]
[2024-11-12 16:12:50,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 16:12:50,468 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:50,468 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-12 16:12:50,469 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-12 16:12:50,471 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-12 16:12:50,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 16:12:50,633 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 16:12:50,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 16:12:50,753 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-11-12 16:12:50,753 INFO  L339         BasicCegarLoop]: Counterexample is feasible
[2024-11-12 16:12:50,754 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (98 of 99 remaining)
[2024-11-12 16:12:50,756 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining)
[2024-11-12 16:12:50,756 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining)
[2024-11-12 16:12:50,757 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining)
[2024-11-12 16:12:50,757 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining)
[2024-11-12 16:12:50,757 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining)
[2024-11-12 16:12:50,757 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining)
[2024-11-12 16:12:50,758 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining)
[2024-11-12 16:12:50,758 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining)
[2024-11-12 16:12:50,759 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining)
[2024-11-12 16:12:50,759 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining)
[2024-11-12 16:12:50,759 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining)
[2024-11-12 16:12:50,759 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining)
[2024-11-12 16:12:50,760 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (85 of 99 remaining)
[2024-11-12 16:12:50,760 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (84 of 99 remaining)
[2024-11-12 16:12:50,760 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining)
[2024-11-12 16:12:50,760 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining)
[2024-11-12 16:12:50,760 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining)
[2024-11-12 16:12:50,761 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining)
[2024-11-12 16:12:50,761 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining)
[2024-11-12 16:12:50,761 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining)
[2024-11-12 16:12:50,761 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining)
[2024-11-12 16:12:50,761 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining)
[2024-11-12 16:12:50,762 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining)
[2024-11-12 16:12:50,762 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining)
[2024-11-12 16:12:50,762 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining)
[2024-11-12 16:12:50,762 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining)
[2024-11-12 16:12:50,765 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining)
[2024-11-12 16:12:50,765 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining)
[2024-11-12 16:12:50,765 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining)
[2024-11-12 16:12:50,765 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining)
[2024-11-12 16:12:50,765 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining)
[2024-11-12 16:12:50,766 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining)
[2024-11-12 16:12:50,768 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining)
[2024-11-12 16:12:50,768 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining)
[2024-11-12 16:12:50,768 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining)
[2024-11-12 16:12:50,769 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining)
[2024-11-12 16:12:50,770 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining)
[2024-11-12 16:12:50,771 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (41 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (40 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining)
[2024-11-12 16:12:50,772 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining)
[2024-11-12 16:12:50,773 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining)
[2024-11-12 16:12:50,774 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining)
[2024-11-12 16:12:50,774 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining)
[2024-11-12 16:12:50,774 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 99 remaining)
[2024-11-12 16:12:50,774 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining)
[2024-11-12 16:12:50,778 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining)
[2024-11-12 16:12:50,778 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining)
[2024-11-12 16:12:50,779 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining)
[2024-11-12 16:12:50,780 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining)
[2024-11-12 16:12:50,781 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining)
[2024-11-12 16:12:50,781 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining)
[2024-11-12 16:12:50,781 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining)
[2024-11-12 16:12:50,781 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining)
[2024-11-12 16:12:50,791 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-12 16:12:50,984 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-12 16:12:50,985 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-12 16:12:51,048 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-12 16:12:51,048 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-12 16:12:51,056 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:12:51 BasicIcfg
[2024-11-12 16:12:51,057 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-12 16:12:51,058 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-12 16:12:51,058 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-12 16:12:51,058 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-12 16:12:51,059 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:41" (3/4) ...
[2024-11-12 16:12:51,061 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-12 16:12:51,062 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-12 16:12:51,063 INFO  L158              Benchmark]: Toolchain (without parser) took 12386.59ms. Allocated memory was 77.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 47.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 424.0MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,063 INFO  L158              Benchmark]: CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-12 16:12:51,063 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 660.59ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 39.4MB in the end (delta: 8.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,064 INFO  L158              Benchmark]: Boogie Procedure Inliner took 69.81ms. Allocated memory is still 77.6MB. Free memory was 39.0MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,064 INFO  L158              Benchmark]: Boogie Preprocessor took 91.20ms. Allocated memory is still 77.6MB. Free memory was 36.2MB in the beginning and 55.3MB in the end (delta: -19.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,064 INFO  L158              Benchmark]: RCFGBuilder took 2223.34ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 54.9MB in the beginning and 49.7MB in the end (delta: 5.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,064 INFO  L158              Benchmark]: TraceAbstraction took 9329.47ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 48.6MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 375.8MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,065 INFO  L158              Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-12 16:12:51,066 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 660.59ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 39.4MB in the end (delta: 8.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 69.81ms. Allocated memory is still 77.6MB. Free memory was 39.0MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 91.20ms. Allocated memory is still 77.6MB. Free memory was 36.2MB in the beginning and 55.3MB in the end (delta: -19.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 2223.34ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 54.9MB in the beginning and 49.7MB in the end (delta: 5.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9329.47ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 48.6MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 375.8MB. Max. memory is 16.1GB.
 * Witness Printer took 4.48ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L715]               0  _Bool __unbuffered_p2_EAX$flush_delayed;
[L716]               0  int __unbuffered_p2_EAX$mem_tmp;
[L717]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd0;
[L718]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd1;
[L719]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd2;
[L720]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd3;
[L721]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p2_EAX$read_delayed;
[L726]               0  int *__unbuffered_p2_EAX$read_delayed_var;
[L727]               0  int __unbuffered_p2_EAX$w_buff0;
[L728]               0  _Bool __unbuffered_p2_EAX$w_buff0_used;
[L729]               0  int __unbuffered_p2_EAX$w_buff1;
[L730]               0  _Bool __unbuffered_p2_EAX$w_buff1_used;
[L732]               0  int __unbuffered_p2_EBX = 0;
[L733]               0  _Bool main$tmp_guard0;
[L734]               0  _Bool main$tmp_guard1;
[L736]               0  int x = 0;
[L736]               0  int x = 0;
[L737]               0  _Bool x$flush_delayed;
[L738]               0  int x$mem_tmp;
[L739]               0  _Bool x$r_buff0_thd0;
[L740]               0  _Bool x$r_buff0_thd1;
[L741]               0  _Bool x$r_buff0_thd2;
[L742]               0  _Bool x$r_buff0_thd3;
[L743]               0  _Bool x$r_buff1_thd0;
[L744]               0  _Bool x$r_buff1_thd1;
[L745]               0  _Bool x$r_buff1_thd2;
[L746]               0  _Bool x$r_buff1_thd3;
[L747]               0  _Bool x$read_delayed;
[L748]               0  int *x$read_delayed_var;
[L749]               0  int x$w_buff0;
[L750]               0  _Bool x$w_buff0_used;
[L751]               0  int x$w_buff1;
[L752]               0  _Bool x$w_buff1_used;
[L754]               0  int y = 0;
[L755]               0  _Bool weak$$choice0;
[L756]               0  _Bool weak$$choice1;
[L757]               0  _Bool weak$$choice2;
[L873]               0  pthread_t t2369;
[L874]  FCALL, FORK  0  pthread_create(&t2369, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L875]               0  pthread_t t2370;
[L876]  FCALL, FORK  0  pthread_create(&t2370, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, t2370=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L791]               2  x$w_buff1 = x$w_buff0
[L792]               2  x$w_buff0 = 1
[L793]               2  x$w_buff1_used = x$w_buff0_used
[L794]               2  x$w_buff0_used = (_Bool)1
[L795]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L795]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L796]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L797]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L798]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L799]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L800]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L803]               2  x$w_buff1 = x$w_buff0
[L804]               2  x$w_buff0 = 2
[L805]               2  x$w_buff1_used = x$w_buff0_used
[L806]               2  x$w_buff0_used = (_Bool)1
[L807]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND TRUE    2  !expression
[L19]   CALL         2  reach_error()
[L18]   COND FALSE   2  !(0)
[L18]                2  __assert_fail ("0", "safe025_power.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0]

  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 162 locations, 99 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 0 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-12 16:12:51,104 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:
UNKNOWN: Overapproximated counterexample