./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e19ca921
Calling Ultimate with: /usr/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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-e19ca92
[2021-12-22 13:31:20,868 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-22 13:31:20,870 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-22 13:31:20,937 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-22 13:31:20,937 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-22 13:31:20,940 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-22 13:31:20,941 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-22 13:31:20,943 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-22 13:31:20,945 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-22 13:31:20,949 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-22 13:31:20,949 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-22 13:31:20,951 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-22 13:31:20,951 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-22 13:31:20,953 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-22 13:31:20,954 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-22 13:31:20,958 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-22 13:31:20,958 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-22 13:31:20,959 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-22 13:31:20,960 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-22 13:31:20,964 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-22 13:31:20,965 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-22 13:31:20,965 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-22 13:31:20,966 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-22 13:31:20,967 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-22 13:31:20,968 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-22 13:31:20,969 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-22 13:31:20,969 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-22 13:31:20,971 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-22 13:31:20,971 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-22 13:31:20,972 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-22 13:31:20,972 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-22 13:31:20,973 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-22 13:31:20,974 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-22 13:31:20,974 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-22 13:31:20,975 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-22 13:31:20,975 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-22 13:31:20,976 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-22 13:31:20,976 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-22 13:31:20,976 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-22 13:31:20,977 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-22 13:31:20,977 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-22 13:31:20,978 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-22 13:31:21,004 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-22 13:31:21,007 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-22 13:31:21,007 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-22 13:31:21,007 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-22 13:31:21,008 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-22 13:31:21,008 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-22 13:31:21,009 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-22 13:31:21,009 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-22 13:31:21,009 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-22 13:31:21,009 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-22 13:31:21,010 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-22 13:31:21,010 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-22 13:31:21,010 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-22 13:31:21,010 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-22 13:31:21,010 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-22 13:31:21,011 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-22 13:31:21,012 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-22 13:31:21,012 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-22 13:31:21,012 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-22 13:31:21,012 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 13:31:21,012 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-22 13:31:21,012 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-22 13:31:21,014 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-22 13:31:21,015 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-22 13:31:21,015 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
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.graphml
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 ! call(reach_error())) )


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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
[2021-12-22 13:31:21,189 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-22 13:31:21,215 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-22 13:31:21,218 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-22 13:31:21,219 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-22 13:31:21,220 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-22 13:31:21,220 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-22 13:31:21,285 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72698a19f/c8a4232d58db4537859267864e377fce/FLAGe04821474
[2021-12-22 13:31:21,730 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-22 13:31:21,730 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-22 13:31:21,742 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72698a19f/c8a4232d58db4537859267864e377fce/FLAGe04821474
[2021-12-22 13:31:22,248 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72698a19f/c8a4232d58db4537859267864e377fce
[2021-12-22 13:31:22,251 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-22 13:31:22,252 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-22 13:31:22,254 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-22 13:31:22,254 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-22 13:31:22,256 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-22 13:31:22,256 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,257 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e358dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22, skipping insertion in model container
[2021-12-22 13:31:22,257 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,263 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-22 13:31:22,298 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-22 13:31:22,438 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2021-12-22 13:31:22,600 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 13:31:22,609 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-22 13:31:22,618 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2021-12-22 13:31:22,679 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 13:31:22,708 INFO  L208         MainTranslator]: Completed translation
[2021-12-22 13:31:22,709 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22 WrapperNode
[2021-12-22 13:31:22,709 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-22 13:31:22,710 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-22 13:31:22,710 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-22 13:31:22,710 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-22 13:31:22,715 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,744 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,768 INFO  L137                Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275
[2021-12-22 13:31:22,768 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-22 13:31:22,769 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-22 13:31:22,769 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-22 13:31:22,769 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-22 13:31:22,774 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,775 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,777 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,783 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,797 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,800 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,808 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,812 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-22 13:31:22,812 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-22 13:31:22,812 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-22 13:31:22,812 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-22 13:31:22,813 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (1/1) ...
[2021-12-22 13:31:22,825 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 13:31:22,837 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 13:31:22,848 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-12-22 13:31:22,855 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-12-22 13:31:22,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-22 13:31:22,891 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-22 13:31:22,891 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-22 13:31:22,891 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-22 13:31:22,891 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-22 13:31:22,892 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-22 13:31:22,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-22 13:31:22,892 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-22 13:31:22,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-22 13:31:22,892 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-22 13:31:22,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-22 13:31:22,892 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-22 13:31:22,892 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-22 13:31:22,893 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-22 13:31:22,893 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-22 13:31:22,894 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-22 13:31:23,028 INFO  L234             CfgBuilder]: Building ICFG
[2021-12-22 13:31:23,030 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-22 13:31:23,549 INFO  L275             CfgBuilder]: Performing block encoding
[2021-12-22 13:31:23,887 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-22 13:31:23,887 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-22 13:31:23,889 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:23 BoogieIcfgContainer
[2021-12-22 13:31:23,889 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-22 13:31:23,891 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-22 13:31:23,891 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-22 13:31:23,893 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-22 13:31:23,893 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:31:22" (1/3) ...
[2021-12-22 13:31:23,894 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:31:23, skipping insertion in model container
[2021-12-22 13:31:23,894 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:22" (2/3) ...
[2021-12-22 13:31:23,894 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:31:23, skipping insertion in model container
[2021-12-22 13:31:23,894 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:23" (3/3) ...
[2021-12-22 13:31:23,895 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-22 13:31:23,899 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-22 13:31:23,899 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-22 13:31:23,899 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-12-22 13:31:23,899 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-22 13:31:23,943 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,944 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,944 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,944 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,944 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,944 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,945 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,945 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,945 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,945 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,946 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,946 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,946 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,946 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,947 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,947 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,947 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,947 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,948 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,948 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,948 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,948 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,949 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,949 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,949 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,949 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,950 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,950 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,950 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,950 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,950 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,951 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,951 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,951 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,951 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,951 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,952 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,953 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,954 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,955 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,955 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,955 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,955 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,956 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,956 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,956 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,956 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,957 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,957 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,957 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,957 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,957 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,958 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,959 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,959 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,959 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,961 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,961 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,961 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,961 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,961 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,962 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,962 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,962 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,962 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,966 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,967 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,969 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,969 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,969 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,970 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,971 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,972 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,973 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,974 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,974 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,974 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,976 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,976 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,976 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,976 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,976 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,977 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,977 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,977 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,977 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,978 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,979 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,980 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,981 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,983 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,984 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,985 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,986 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,992 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,992 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,992 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,992 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,993 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,993 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,993 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,993 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,993 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,994 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,994 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,994 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,994 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,996 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,996 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,996 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,996 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,997 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,997 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:23,997 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,002 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,003 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,003 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,003 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,003 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,005 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,006 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,007 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,007 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,008 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,008 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,008 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,008 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,008 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,009 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,010 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,011 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,012 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,013 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,014 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,015 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,015 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,015 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,015 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,015 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,016 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,017 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,017 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,017 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,017 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:24,017 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-22 13:31:24,051 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-22 13:31:24,056 INFO  L339      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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR
[2021-12-22 13:31:24,056 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-12-22 13:31:24,063 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow
[2021-12-22 13:31:24,088 INFO  L129       PetriNetUnfolder]: 2/112 cut-off events.
[2021-12-22 13:31:24,088 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-22 13:31:24,090 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2021-12-22 13:31:24,091 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow
[2021-12-22 13:31:24,093 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow
[2021-12-22 13:31:24,098 INFO  L129       PetriNetUnfolder]: 0/45 cut-off events.
[2021-12-22 13:31:24,099 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-22 13:31:24,099 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:24,099 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:24,100 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:24,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:24,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 1496034097, now seen corresponding path program 1 times
[2021-12-22 13:31:24,109 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:24,109 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132219186]
[2021-12-22 13:31:24,109 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:24,110 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:24,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:24,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:24,296 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:24,296 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132219186]
[2021-12-22 13:31:24,297 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132219186] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:24,297 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:24,297 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 13:31:24,298 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470630307]
[2021-12-22 13:31:24,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:24,305 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 13:31:24,305 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:24,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 13:31:24,328 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 13:31:24,331 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115
[2021-12-22 13:31:24,336 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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)
[2021-12-22 13:31:24,336 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:24,336 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115
[2021-12-22 13:31:24,337 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:24,562 INFO  L129       PetriNetUnfolder]: 124/550 cut-off events.
[2021-12-22 13:31:24,562 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2021-12-22 13:31:24,565 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 781 conditions, 550 events. 124/550 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2989 event pairs, 24 based on Foata normal form. 23/542 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. 
[2021-12-22 13:31:24,569 INFO  L132   encePairwiseOnDemand]: 110/115 looper letters, 18 selfloop transitions, 2 changer transitions 0/116 dead transitions.
[2021-12-22 13:31:24,569 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 287 flow
[2021-12-22 13:31:24,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-12-22 13:31:24,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-12-22 13:31:24,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions.
[2021-12-22 13:31:24,581 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9333333333333333
[2021-12-22 13:31:24,581 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 322 transitions.
[2021-12-22 13:31:24,582 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions.
[2021-12-22 13:31:24,583 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:24,584 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions.
[2021-12-22 13:31:24,587 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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)
[2021-12-22 13:31:24,591 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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)
[2021-12-22 13:31:24,591 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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)
[2021-12-22 13:31:24,593 INFO  L186             Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 322 transitions.
[2021-12-22 13:31:24,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 287 flow
[2021-12-22 13:31:24,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 116 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-22 13:31:24,597 INFO  L242             Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow
[2021-12-22 13:31:24,598 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108}
[2021-12-22 13:31:24,601 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places.
[2021-12-22 13:31:24,601 INFO  L470      AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow
[2021-12-22 13:31:24,601 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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)
[2021-12-22 13:31:24,601 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:24,601 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:24,602 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-22 13:31:24,602 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:24,602 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:24,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542640867, now seen corresponding path program 1 times
[2021-12-22 13:31:24,603 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:24,603 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787892584]
[2021-12-22 13:31:24,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:24,603 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:24,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:24,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:24,792 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:24,792 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787892584]
[2021-12-22 13:31:24,792 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787892584] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:24,792 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:24,792 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:24,792 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428181422]
[2021-12-22 13:31:24,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:24,793 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:24,793 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:24,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:24,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:24,795 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115
[2021-12-22 13:31:24,795 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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)
[2021-12-22 13:31:24,795 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:24,795 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115
[2021-12-22 13:31:24,795 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:25,209 INFO  L129       PetriNetUnfolder]: 488/1441 cut-off events.
[2021-12-22 13:31:25,209 INFO  L130       PetriNetUnfolder]: For 95/95 co-relation queries the response was YES.
[2021-12-22 13:31:25,213 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1441 events. 488/1441 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10190 event pairs, 102 based on Foata normal form. 0/1397 useless extension candidates. Maximal degree in co-relation 2283. Up to 403 conditions per place. 
[2021-12-22 13:31:25,218 INFO  L132   encePairwiseOnDemand]: 109/115 looper letters, 19 selfloop transitions, 2 changer transitions 48/148 dead transitions.
[2021-12-22 13:31:25,218 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 436 flow
[2021-12-22 13:31:25,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:25,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:25,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 897 transitions.
[2021-12-22 13:31:25,223 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8666666666666667
[2021-12-22 13:31:25,223 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 897 transitions.
[2021-12-22 13:31:25,223 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 897 transitions.
[2021-12-22 13:31:25,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:25,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 897 transitions.
[2021-12-22 13:31:25,228 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 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)
[2021-12-22 13:31:25,231 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:25,232 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:25,232 INFO  L186             Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 897 transitions.
[2021-12-22 13:31:25,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 436 flow
[2021-12-22 13:31:25,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 148 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-12-22 13:31:25,238 INFO  L242             Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow
[2021-12-22 13:31:25,238 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96}
[2021-12-22 13:31:25,239 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places.
[2021-12-22 13:31:25,240 INFO  L470      AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow
[2021-12-22 13:31:25,240 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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)
[2021-12-22 13:31:25,240 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:25,240 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:25,241 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-22 13:31:25,241 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:25,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:25,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032371874, now seen corresponding path program 1 times
[2021-12-22 13:31:25,242 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:25,242 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42562518]
[2021-12-22 13:31:25,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:25,242 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:25,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:25,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:25,440 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:25,440 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42562518]
[2021-12-22 13:31:25,440 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42562518] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:25,440 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:25,441 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:25,441 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056067935]
[2021-12-22 13:31:25,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:25,442 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:25,442 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:25,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:25,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:25,444 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115
[2021-12-22 13:31:25,445 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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)
[2021-12-22 13:31:25,445 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:25,445 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115
[2021-12-22 13:31:25,445 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:25,769 INFO  L129       PetriNetUnfolder]: 492/1068 cut-off events.
[2021-12-22 13:31:25,770 INFO  L130       PetriNetUnfolder]: For 262/262 co-relation queries the response was YES.
[2021-12-22 13:31:25,772 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 1068 events. 492/1068 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5802 event pairs, 174 based on Foata normal form. 27/1051 useless extension candidates. Maximal degree in co-relation 2101. Up to 412 conditions per place. 
[2021-12-22 13:31:25,775 INFO  L132   encePairwiseOnDemand]: 109/115 looper letters, 23 selfloop transitions, 2 changer transitions 37/140 dead transitions.
[2021-12-22 13:31:25,775 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 140 transitions, 453 flow
[2021-12-22 13:31:25,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:25,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:25,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions.
[2021-12-22 13:31:25,777 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8618357487922705
[2021-12-22 13:31:25,777 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 892 transitions.
[2021-12-22 13:31:25,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions.
[2021-12-22 13:31:25,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:25,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions.
[2021-12-22 13:31:25,779 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 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)
[2021-12-22 13:31:25,780 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:25,781 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:25,781 INFO  L186             Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 9 states and 892 transitions.
[2021-12-22 13:31:25,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 140 transitions, 453 flow
[2021-12-22 13:31:25,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 140 transitions, 419 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:25,786 INFO  L242             Difference]: Finished difference. Result has 119 places, 96 transitions, 222 flow
[2021-12-22 13:31:25,786 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=119, PETRI_TRANSITIONS=96}
[2021-12-22 13:31:25,787 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places.
[2021-12-22 13:31:25,787 INFO  L470      AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 222 flow
[2021-12-22 13:31:25,787 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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)
[2021-12-22 13:31:25,787 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:25,787 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:25,787 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-22 13:31:25,787 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:25,788 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:25,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 694272605, now seen corresponding path program 1 times
[2021-12-22 13:31:25,788 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:25,788 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999342595]
[2021-12-22 13:31:25,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:25,788 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:25,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:25,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:25,990 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:25,990 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999342595]
[2021-12-22 13:31:25,990 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999342595] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:25,990 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:25,990 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-22 13:31:25,990 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765792758]
[2021-12-22 13:31:25,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:25,991 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-22 13:31:25,991 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:25,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-22 13:31:25,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2021-12-22 13:31:25,992 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115
[2021-12-22 13:31:25,993 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 222 flow. Second operand  has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 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)
[2021-12-22 13:31:25,993 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:25,993 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115
[2021-12-22 13:31:25,994 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:26,534 INFO  L129       PetriNetUnfolder]: 687/1412 cut-off events.
[2021-12-22 13:31:26,534 INFO  L130       PetriNetUnfolder]: For 392/392 co-relation queries the response was YES.
[2021-12-22 13:31:26,538 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 1412 events. 687/1412 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7879 event pairs, 103 based on Foata normal form. 30/1385 useless extension candidates. Maximal degree in co-relation 2852. Up to 484 conditions per place. 
[2021-12-22 13:31:26,542 INFO  L132   encePairwiseOnDemand]: 100/115 looper letters, 26 selfloop transitions, 11 changer transitions 61/173 dead transitions.
[2021-12-22 13:31:26,542 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 173 transitions, 618 flow
[2021-12-22 13:31:26,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-22 13:31:26,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-22 13:31:26,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1436 transitions.
[2021-12-22 13:31:26,546 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.832463768115942
[2021-12-22 13:31:26,546 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1436 transitions.
[2021-12-22 13:31:26,546 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1436 transitions.
[2021-12-22 13:31:26,547 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:26,547 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1436 transitions.
[2021-12-22 13:31:26,550 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 95.73333333333333) internal successors, (1436), 15 states have internal predecessors, (1436), 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)
[2021-12-22 13:31:26,552 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 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)
[2021-12-22 13:31:26,553 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 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)
[2021-12-22 13:31:26,553 INFO  L186             Difference]: Start difference. First operand has 119 places, 96 transitions, 222 flow. Second operand 15 states and 1436 transitions.
[2021-12-22 13:31:26,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 173 transitions, 618 flow
[2021-12-22 13:31:26,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 173 transitions, 578 flow, removed 18 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:26,561 INFO  L242             Difference]: Finished difference. Result has 131 places, 102 transitions, 332 flow
[2021-12-22 13:31:26,561 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=332, PETRI_PLACES=131, PETRI_TRANSITIONS=102}
[2021-12-22 13:31:26,562 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places.
[2021-12-22 13:31:26,563 INFO  L470      AbstractCegarLoop]: Abstraction has has 131 places, 102 transitions, 332 flow
[2021-12-22 13:31:26,563 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 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)
[2021-12-22 13:31:26,563 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:26,564 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:26,564 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-22 13:31:26,564 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:26,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:26,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -1100445766, now seen corresponding path program 1 times
[2021-12-22 13:31:26,565 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:26,565 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137607881]
[2021-12-22 13:31:26,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:26,566 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:26,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:26,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:26,663 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:26,663 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137607881]
[2021-12-22 13:31:26,663 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137607881] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:26,663 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:26,663 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-22 13:31:26,663 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844323948]
[2021-12-22 13:31:26,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:26,664 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-22 13:31:26,664 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:26,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-22 13:31:26,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-12-22 13:31:26,665 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115
[2021-12-22 13:31:26,666 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 102 transitions, 332 flow. Second operand  has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 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)
[2021-12-22 13:31:26,666 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:26,666 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115
[2021-12-22 13:31:26,666 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:27,067 INFO  L129       PetriNetUnfolder]: 718/1488 cut-off events.
[2021-12-22 13:31:27,068 INFO  L130       PetriNetUnfolder]: For 5681/6732 co-relation queries the response was YES.
[2021-12-22 13:31:27,073 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 1488 events. 718/1488 cut-off events. For 5681/6732 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8109 event pairs, 170 based on Foata normal form. 35/1427 useless extension candidates. Maximal degree in co-relation 5785. Up to 619 conditions per place. 
[2021-12-22 13:31:27,078 INFO  L132   encePairwiseOnDemand]: 107/115 looper letters, 36 selfloop transitions, 4 changer transitions 40/157 dead transitions.
[2021-12-22 13:31:27,078 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 157 transitions, 867 flow
[2021-12-22 13:31:27,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:27,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:27,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions.
[2021-12-22 13:31:27,081 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8452173913043478
[2021-12-22 13:31:27,081 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 972 transitions.
[2021-12-22 13:31:27,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions.
[2021-12-22 13:31:27,082 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:27,082 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions.
[2021-12-22 13:31:27,083 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 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)
[2021-12-22 13:31:27,085 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:27,085 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:27,085 INFO  L186             Difference]: Start difference. First operand has 131 places, 102 transitions, 332 flow. Second operand 10 states and 972 transitions.
[2021-12-22 13:31:27,085 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 157 transitions, 867 flow
[2021-12-22 13:31:27,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 157 transitions, 818 flow, removed 14 selfloop flow, removed 6 redundant places.
[2021-12-22 13:31:27,093 INFO  L242             Difference]: Finished difference. Result has 133 places, 100 transitions, 327 flow
[2021-12-22 13:31:27,094 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=327, PETRI_PLACES=133, PETRI_TRANSITIONS=100}
[2021-12-22 13:31:27,094 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places.
[2021-12-22 13:31:27,094 INFO  L470      AbstractCegarLoop]: Abstraction has has 133 places, 100 transitions, 327 flow
[2021-12-22 13:31:27,095 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 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)
[2021-12-22 13:31:27,095 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:27,095 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:27,095 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-22 13:31:27,095 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:27,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:27,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 262090471, now seen corresponding path program 1 times
[2021-12-22 13:31:27,096 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:27,096 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548953208]
[2021-12-22 13:31:27,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:27,096 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:27,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:27,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:27,244 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:27,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548953208]
[2021-12-22 13:31:27,244 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548953208] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:27,244 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:27,244 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:27,244 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081789375]
[2021-12-22 13:31:27,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:27,245 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:27,245 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:27,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:27,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:27,246 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115
[2021-12-22 13:31:27,247 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 100 transitions, 327 flow. Second operand  has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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)
[2021-12-22 13:31:27,247 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:27,247 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115
[2021-12-22 13:31:27,247 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:27,475 INFO  L129       PetriNetUnfolder]: 293/685 cut-off events.
[2021-12-22 13:31:27,475 INFO  L130       PetriNetUnfolder]: For 3035/3231 co-relation queries the response was YES.
[2021-12-22 13:31:27,477 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 685 events. 293/685 cut-off events. For 3035/3231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3047 event pairs, 96 based on Foata normal form. 19/677 useless extension candidates. Maximal degree in co-relation 2744. Up to 300 conditions per place. 
[2021-12-22 13:31:27,480 INFO  L132   encePairwiseOnDemand]: 109/115 looper letters, 21 selfloop transitions, 2 changer transitions 25/128 dead transitions.
[2021-12-22 13:31:27,480 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 629 flow
[2021-12-22 13:31:27,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:27,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:27,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 884 transitions.
[2021-12-22 13:31:27,482 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8541062801932368
[2021-12-22 13:31:27,482 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 884 transitions.
[2021-12-22 13:31:27,482 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 884 transitions.
[2021-12-22 13:31:27,483 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:27,483 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 884 transitions.
[2021-12-22 13:31:27,484 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 98.22222222222223) internal successors, (884), 9 states have internal predecessors, (884), 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)
[2021-12-22 13:31:27,485 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:27,486 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:27,486 INFO  L186             Difference]: Start difference. First operand has 133 places, 100 transitions, 327 flow. Second operand 9 states and 884 transitions.
[2021-12-22 13:31:27,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 629 flow
[2021-12-22 13:31:27,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 128 transitions, 561 flow, removed 28 selfloop flow, removed 14 redundant places.
[2021-12-22 13:31:27,491 INFO  L242             Difference]: Finished difference. Result has 128 places, 100 transitions, 307 flow
[2021-12-22 13:31:27,491 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=128, PETRI_TRANSITIONS=100}
[2021-12-22 13:31:27,492 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places.
[2021-12-22 13:31:27,492 INFO  L470      AbstractCegarLoop]: Abstraction has has 128 places, 100 transitions, 307 flow
[2021-12-22 13:31:27,492 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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)
[2021-12-22 13:31:27,492 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:27,492 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:27,493 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-22 13:31:27,493 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:27,493 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:27,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -926541095, now seen corresponding path program 1 times
[2021-12-22 13:31:27,493 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:27,493 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782726590]
[2021-12-22 13:31:27,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:27,494 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:27,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:27,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:27,689 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:27,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782726590]
[2021-12-22 13:31:27,689 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782726590] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:27,689 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:27,689 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-22 13:31:27,689 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895335241]
[2021-12-22 13:31:27,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:27,690 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-22 13:31:27,690 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:27,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-22 13:31:27,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-12-22 13:31:27,691 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 115
[2021-12-22 13:31:27,692 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 100 transitions, 307 flow. Second operand  has 10 states, 10 states have (on average 89.8) internal successors, (898), 10 states have internal predecessors, (898), 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)
[2021-12-22 13:31:27,692 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:27,692 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 115
[2021-12-22 13:31:27,692 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:28,026 INFO  L129       PetriNetUnfolder]: 302/755 cut-off events.
[2021-12-22 13:31:28,026 INFO  L130       PetriNetUnfolder]: For 2205/2597 co-relation queries the response was YES.
[2021-12-22 13:31:28,028 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 755 events. 302/755 cut-off events. For 2205/2597 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3823 event pairs, 74 based on Foata normal form. 22/756 useless extension candidates. Maximal degree in co-relation 2747. Up to 330 conditions per place. 
[2021-12-22 13:31:28,031 INFO  L132   encePairwiseOnDemand]: 102/115 looper letters, 28 selfloop transitions, 15 changer transitions 18/135 dead transitions.
[2021-12-22 13:31:28,031 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 135 transitions, 691 flow
[2021-12-22 13:31:28,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:28,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:28,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 939 transitions.
[2021-12-22 13:31:28,033 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8165217391304348
[2021-12-22 13:31:28,033 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 939 transitions.
[2021-12-22 13:31:28,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 939 transitions.
[2021-12-22 13:31:28,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:28,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 939 transitions.
[2021-12-22 13:31:28,035 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 93.9) internal successors, (939), 10 states have internal predecessors, (939), 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)
[2021-12-22 13:31:28,036 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:28,037 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:28,037 INFO  L186             Difference]: Start difference. First operand has 128 places, 100 transitions, 307 flow. Second operand 10 states and 939 transitions.
[2021-12-22 13:31:28,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 135 transitions, 691 flow
[2021-12-22 13:31:28,040 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 135 transitions, 663 flow, removed 10 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:28,041 INFO  L242             Difference]: Finished difference. Result has 130 places, 109 transitions, 432 flow
[2021-12-22 13:31:28,041 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=432, PETRI_PLACES=130, PETRI_TRANSITIONS=109}
[2021-12-22 13:31:28,042 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places.
[2021-12-22 13:31:28,042 INFO  L470      AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 432 flow
[2021-12-22 13:31:28,042 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 89.8) internal successors, (898), 10 states have internal predecessors, (898), 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)
[2021-12-22 13:31:28,042 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:28,042 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:28,042 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-22 13:31:28,042 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:28,043 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:28,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -1772694617, now seen corresponding path program 2 times
[2021-12-22 13:31:28,043 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:28,043 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715238200]
[2021-12-22 13:31:28,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:28,043 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:28,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:28,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:28,157 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:28,157 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715238200]
[2021-12-22 13:31:28,157 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715238200] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:28,157 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:28,157 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-22 13:31:28,157 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843171806]
[2021-12-22 13:31:28,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:28,157 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-22 13:31:28,157 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:28,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-22 13:31:28,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-12-22 13:31:28,158 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 115
[2021-12-22 13:31:28,159 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 109 transitions, 432 flow. Second operand  has 9 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 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)
[2021-12-22 13:31:28,159 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:28,159 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 115
[2021-12-22 13:31:28,159 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:28,446 INFO  L129       PetriNetUnfolder]: 296/720 cut-off events.
[2021-12-22 13:31:28,446 INFO  L130       PetriNetUnfolder]: For 2781/3600 co-relation queries the response was YES.
[2021-12-22 13:31:28,449 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 720 events. 296/720 cut-off events. For 2781/3600 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3482 event pairs, 60 based on Foata normal form. 32/733 useless extension candidates. Maximal degree in co-relation 2934. Up to 322 conditions per place. 
[2021-12-22 13:31:28,452 INFO  L132   encePairwiseOnDemand]: 103/115 looper letters, 28 selfloop transitions, 10 changer transitions 22/134 dead transitions.
[2021-12-22 13:31:28,452 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 756 flow
[2021-12-22 13:31:28,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:28,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:28,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 847 transitions.
[2021-12-22 13:31:28,454 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8183574879227054
[2021-12-22 13:31:28,454 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 847 transitions.
[2021-12-22 13:31:28,454 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 847 transitions.
[2021-12-22 13:31:28,455 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:28,455 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 847 transitions.
[2021-12-22 13:31:28,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 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)
[2021-12-22 13:31:28,458 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:28,459 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:28,459 INFO  L186             Difference]: Start difference. First operand has 130 places, 109 transitions, 432 flow. Second operand 9 states and 847 transitions.
[2021-12-22 13:31:28,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 756 flow
[2021-12-22 13:31:28,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 718 flow, removed 16 selfloop flow, removed 5 redundant places.
[2021-12-22 13:31:28,464 INFO  L242             Difference]: Finished difference. Result has 134 places, 104 transitions, 394 flow
[2021-12-22 13:31:28,464 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=134, PETRI_TRANSITIONS=104}
[2021-12-22 13:31:28,464 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places.
[2021-12-22 13:31:28,464 INFO  L470      AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 394 flow
[2021-12-22 13:31:28,465 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 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)
[2021-12-22 13:31:28,465 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:28,465 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:28,465 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-22 13:31:28,465 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:28,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:28,466 INFO  L85        PathProgramCache]: Analyzing trace with hash 774687681, now seen corresponding path program 3 times
[2021-12-22 13:31:28,466 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:28,466 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55845818]
[2021-12-22 13:31:28,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:28,466 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:28,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:28,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:28,603 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:28,604 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55845818]
[2021-12-22 13:31:28,604 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55845818] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:28,604 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:28,604 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-22 13:31:28,604 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115147588]
[2021-12-22 13:31:28,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:28,605 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-22 13:31:28,605 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:28,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-22 13:31:28,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-12-22 13:31:28,606 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115
[2021-12-22 13:31:28,607 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 394 flow. Second operand  has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 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)
[2021-12-22 13:31:28,607 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:28,607 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115
[2021-12-22 13:31:28,607 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:28,952 INFO  L129       PetriNetUnfolder]: 268/652 cut-off events.
[2021-12-22 13:31:28,952 INFO  L130       PetriNetUnfolder]: For 2928/3161 co-relation queries the response was YES.
[2021-12-22 13:31:28,954 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 652 events. 268/652 cut-off events. For 2928/3161 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2888 event pairs, 43 based on Foata normal form. 30/670 useless extension candidates. Maximal degree in co-relation 2699. Up to 283 conditions per place. 
[2021-12-22 13:31:28,957 INFO  L132   encePairwiseOnDemand]: 101/115 looper letters, 28 selfloop transitions, 13 changer transitions 34/148 dead transitions.
[2021-12-22 13:31:28,957 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 148 transitions, 963 flow
[2021-12-22 13:31:28,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-22 13:31:28,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-22 13:31:28,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1290 transitions.
[2021-12-22 13:31:28,959 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8012422360248447
[2021-12-22 13:31:28,959 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1290 transitions.
[2021-12-22 13:31:28,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1290 transitions.
[2021-12-22 13:31:28,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:28,960 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1290 transitions.
[2021-12-22 13:31:28,961 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 92.14285714285714) internal successors, (1290), 14 states have internal predecessors, (1290), 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)
[2021-12-22 13:31:28,963 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:28,963 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:28,964 INFO  L186             Difference]: Start difference. First operand has 134 places, 104 transitions, 394 flow. Second operand 14 states and 1290 transitions.
[2021-12-22 13:31:28,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 148 transitions, 963 flow
[2021-12-22 13:31:28,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 148 transitions, 860 flow, removed 36 selfloop flow, removed 10 redundant places.
[2021-12-22 13:31:28,968 INFO  L242             Difference]: Finished difference. Result has 141 places, 106 transitions, 442 flow
[2021-12-22 13:31:28,968 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=442, PETRI_PLACES=141, PETRI_TRANSITIONS=106}
[2021-12-22 13:31:28,968 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 21 predicate places.
[2021-12-22 13:31:28,969 INFO  L470      AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 442 flow
[2021-12-22 13:31:28,969 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 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)
[2021-12-22 13:31:28,969 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:28,969 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:28,969 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-22 13:31:28,969 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:28,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:28,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -1037522581, now seen corresponding path program 4 times
[2021-12-22 13:31:28,970 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:28,970 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755810101]
[2021-12-22 13:31:28,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:28,970 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:29,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:29,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:29,139 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:29,139 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755810101]
[2021-12-22 13:31:29,139 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755810101] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:29,139 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:29,139 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-22 13:31:29,139 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802745002]
[2021-12-22 13:31:29,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:29,139 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-22 13:31:29,139 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:29,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-22 13:31:29,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2021-12-22 13:31:29,141 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115
[2021-12-22 13:31:29,141 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 106 transitions, 442 flow. Second operand  has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:29,141 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:29,141 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115
[2021-12-22 13:31:29,141 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:29,493 INFO  L129       PetriNetUnfolder]: 232/582 cut-off events.
[2021-12-22 13:31:29,493 INFO  L130       PetriNetUnfolder]: For 4366/4504 co-relation queries the response was YES.
[2021-12-22 13:31:29,495 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 582 events. 232/582 cut-off events. For 4366/4504 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2500 event pairs, 46 based on Foata normal form. 29/597 useless extension candidates. Maximal degree in co-relation 2687. Up to 240 conditions per place. 
[2021-12-22 13:31:29,498 INFO  L132   encePairwiseOnDemand]: 102/115 looper letters, 26 selfloop transitions, 15 changer transitions 32/146 dead transitions.
[2021-12-22 13:31:29,498 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 146 transitions, 1077 flow
[2021-12-22 13:31:29,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-22 13:31:29,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-22 13:31:29,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1285 transitions.
[2021-12-22 13:31:29,500 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7981366459627329
[2021-12-22 13:31:29,500 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1285 transitions.
[2021-12-22 13:31:29,500 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1285 transitions.
[2021-12-22 13:31:29,501 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:29,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1285 transitions.
[2021-12-22 13:31:29,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 91.78571428571429) internal successors, (1285), 14 states have internal predecessors, (1285), 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)
[2021-12-22 13:31:29,504 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:29,505 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:29,505 INFO  L186             Difference]: Start difference. First operand has 141 places, 106 transitions, 442 flow. Second operand 14 states and 1285 transitions.
[2021-12-22 13:31:29,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 146 transitions, 1077 flow
[2021-12-22 13:31:29,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 146 transitions, 878 flow, removed 81 selfloop flow, removed 14 redundant places.
[2021-12-22 13:31:29,510 INFO  L242             Difference]: Finished difference. Result has 142 places, 108 transitions, 471 flow
[2021-12-22 13:31:29,510 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=471, PETRI_PLACES=142, PETRI_TRANSITIONS=108}
[2021-12-22 13:31:29,510 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 22 predicate places.
[2021-12-22 13:31:29,511 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 471 flow
[2021-12-22 13:31:29,511 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 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)
[2021-12-22 13:31:29,511 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:29,511 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:29,511 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-22 13:31:29,511 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:29,511 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:29,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1495659870, now seen corresponding path program 1 times
[2021-12-22 13:31:29,512 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:29,512 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621629481]
[2021-12-22 13:31:29,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:29,512 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:29,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:29,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:29,631 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:29,631 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621629481]
[2021-12-22 13:31:29,631 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621629481] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:29,631 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:29,631 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-22 13:31:29,631 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301470914]
[2021-12-22 13:31:29,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:29,631 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-22 13:31:29,631 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:29,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-22 13:31:29,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-12-22 13:31:29,632 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115
[2021-12-22 13:31:29,633 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 108 transitions, 471 flow. Second operand  has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 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)
[2021-12-22 13:31:29,633 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:29,633 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115
[2021-12-22 13:31:29,633 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:29,936 INFO  L129       PetriNetUnfolder]: 221/612 cut-off events.
[2021-12-22 13:31:29,936 INFO  L130       PetriNetUnfolder]: For 4409/4636 co-relation queries the response was YES.
[2021-12-22 13:31:29,938 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 612 events. 221/612 cut-off events. For 4409/4636 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2895 event pairs, 44 based on Foata normal form. 33/632 useless extension candidates. Maximal degree in co-relation 2636. Up to 244 conditions per place. 
[2021-12-22 13:31:29,941 INFO  L132   encePairwiseOnDemand]: 104/115 looper letters, 38 selfloop transitions, 15 changer transitions 25/150 dead transitions.
[2021-12-22 13:31:29,941 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 150 transitions, 1059 flow
[2021-12-22 13:31:29,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:29,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:29,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 928 transitions.
[2021-12-22 13:31:29,943 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8069565217391305
[2021-12-22 13:31:29,943 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 928 transitions.
[2021-12-22 13:31:29,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 928 transitions.
[2021-12-22 13:31:29,943 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:29,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 928 transitions.
[2021-12-22 13:31:29,945 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 92.8) internal successors, (928), 10 states have internal predecessors, (928), 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)
[2021-12-22 13:31:29,946 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:29,946 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:29,946 INFO  L186             Difference]: Start difference. First operand has 142 places, 108 transitions, 471 flow. Second operand 10 states and 928 transitions.
[2021-12-22 13:31:29,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 150 transitions, 1059 flow
[2021-12-22 13:31:29,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 882 flow, removed 74 selfloop flow, removed 12 redundant places.
[2021-12-22 13:31:29,952 INFO  L242             Difference]: Finished difference. Result has 139 places, 116 transitions, 534 flow
[2021-12-22 13:31:29,952 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=534, PETRI_PLACES=139, PETRI_TRANSITIONS=116}
[2021-12-22 13:31:29,952 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 19 predicate places.
[2021-12-22 13:31:29,952 INFO  L470      AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 534 flow
[2021-12-22 13:31:29,952 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 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)
[2021-12-22 13:31:29,952 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:29,953 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:29,953 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-22 13:31:29,953 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:29,953 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:29,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002869008, now seen corresponding path program 2 times
[2021-12-22 13:31:29,953 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:29,953 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600145624]
[2021-12-22 13:31:29,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:29,953 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:29,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:30,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:30,124 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:30,124 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600145624]
[2021-12-22 13:31:30,124 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600145624] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:30,124 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:30,124 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-22 13:31:30,124 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620934855]
[2021-12-22 13:31:30,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:30,124 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-22 13:31:30,124 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:30,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-22 13:31:30,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2021-12-22 13:31:30,126 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115
[2021-12-22 13:31:30,126 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 116 transitions, 534 flow. Second operand  has 11 states, 11 states have (on average 86.0909090909091) internal successors, (947), 11 states have internal predecessors, (947), 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)
[2021-12-22 13:31:30,126 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:30,126 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115
[2021-12-22 13:31:30,126 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:30,568 INFO  L129       PetriNetUnfolder]: 220/640 cut-off events.
[2021-12-22 13:31:30,569 INFO  L130       PetriNetUnfolder]: For 2406/2686 co-relation queries the response was YES.
[2021-12-22 13:31:30,570 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 640 events. 220/640 cut-off events. For 2406/2686 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2958 event pairs, 56 based on Foata normal form. 26/640 useless extension candidates. Maximal degree in co-relation 2369. Up to 210 conditions per place. 
[2021-12-22 13:31:30,573 INFO  L132   encePairwiseOnDemand]: 104/115 looper letters, 52 selfloop transitions, 16 changer transitions 31/169 dead transitions.
[2021-12-22 13:31:30,573 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 169 transitions, 1152 flow
[2021-12-22 13:31:30,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-22 13:31:30,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-22 13:31:30,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1260 transitions.
[2021-12-22 13:31:30,575 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.782608695652174
[2021-12-22 13:31:30,575 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1260 transitions.
[2021-12-22 13:31:30,575 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1260 transitions.
[2021-12-22 13:31:30,575 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:30,575 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1260 transitions.
[2021-12-22 13:31:30,577 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 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)
[2021-12-22 13:31:30,579 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:30,579 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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)
[2021-12-22 13:31:30,579 INFO  L186             Difference]: Start difference. First operand has 139 places, 116 transitions, 534 flow. Second operand 14 states and 1260 transitions.
[2021-12-22 13:31:30,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 169 transitions, 1152 flow
[2021-12-22 13:31:30,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 169 transitions, 1102 flow, removed 23 selfloop flow, removed 6 redundant places.
[2021-12-22 13:31:30,584 INFO  L242             Difference]: Finished difference. Result has 151 places, 119 transitions, 608 flow
[2021-12-22 13:31:30,584 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=608, PETRI_PLACES=151, PETRI_TRANSITIONS=119}
[2021-12-22 13:31:30,585 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 31 predicate places.
[2021-12-22 13:31:30,585 INFO  L470      AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 608 flow
[2021-12-22 13:31:30,585 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 86.0909090909091) internal successors, (947), 11 states have internal predecessors, (947), 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)
[2021-12-22 13:31:30,585 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:30,586 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:30,586 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-22 13:31:30,586 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:30,586 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:30,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 509597458, now seen corresponding path program 1 times
[2021-12-22 13:31:30,586 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:30,586 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979290136]
[2021-12-22 13:31:30,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:30,587 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:30,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:30,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:30,804 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:30,804 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979290136]
[2021-12-22 13:31:30,804 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979290136] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:30,804 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:30,805 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-22 13:31:30,805 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541964541]
[2021-12-22 13:31:30,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:30,805 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-22 13:31:30,805 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:30,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-22 13:31:30,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2021-12-22 13:31:30,806 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 115
[2021-12-22 13:31:30,807 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 608 flow. Second operand  has 12 states, 12 states have (on average 86.83333333333333) internal successors, (1042), 12 states have internal predecessors, (1042), 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)
[2021-12-22 13:31:30,807 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:30,807 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 115
[2021-12-22 13:31:30,807 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:31,424 INFO  L129       PetriNetUnfolder]: 254/698 cut-off events.
[2021-12-22 13:31:31,425 INFO  L130       PetriNetUnfolder]: For 3779/4214 co-relation queries the response was YES.
[2021-12-22 13:31:31,427 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 698 events. 254/698 cut-off events. For 3779/4214 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3558 event pairs, 5 based on Foata normal form. 46/734 useless extension candidates. Maximal degree in co-relation 3040. Up to 240 conditions per place. 
[2021-12-22 13:31:31,430 INFO  L132   encePairwiseOnDemand]: 102/115 looper letters, 48 selfloop transitions, 39 changer transitions 61/219 dead transitions.
[2021-12-22 13:31:31,430 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 219 transitions, 1939 flow
[2021-12-22 13:31:31,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-12-22 13:31:31,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-12-22 13:31:31,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1538 transitions.
[2021-12-22 13:31:31,433 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7867007672634271
[2021-12-22 13:31:31,433 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1538 transitions.
[2021-12-22 13:31:31,433 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1538 transitions.
[2021-12-22 13:31:31,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:31,435 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1538 transitions.
[2021-12-22 13:31:31,437 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 90.47058823529412) internal successors, (1538), 17 states have internal predecessors, (1538), 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)
[2021-12-22 13:31:31,443 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 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)
[2021-12-22 13:31:31,444 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 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)
[2021-12-22 13:31:31,444 INFO  L186             Difference]: Start difference. First operand has 151 places, 119 transitions, 608 flow. Second operand 17 states and 1538 transitions.
[2021-12-22 13:31:31,444 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 219 transitions, 1939 flow
[2021-12-22 13:31:31,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 219 transitions, 1854 flow, removed 41 selfloop flow, removed 10 redundant places.
[2021-12-22 13:31:31,453 INFO  L242             Difference]: Finished difference. Result has 160 places, 144 transitions, 1028 flow
[2021-12-22 13:31:31,453 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1028, PETRI_PLACES=160, PETRI_TRANSITIONS=144}
[2021-12-22 13:31:31,454 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places.
[2021-12-22 13:31:31,454 INFO  L470      AbstractCegarLoop]: Abstraction has has 160 places, 144 transitions, 1028 flow
[2021-12-22 13:31:31,454 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 86.83333333333333) internal successors, (1042), 12 states have internal predecessors, (1042), 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)
[2021-12-22 13:31:31,455 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:31,455 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:31,455 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-22 13:31:31,455 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:31,455 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:31,455 INFO  L85        PathProgramCache]: Analyzing trace with hash -974083043, now seen corresponding path program 1 times
[2021-12-22 13:31:31,456 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:31,456 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541502045]
[2021-12-22 13:31:31,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:31,456 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:31,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:31,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:31,688 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:31,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541502045]
[2021-12-22 13:31:31,689 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541502045] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:31,689 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:31,689 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-22 13:31:31,689 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556780356]
[2021-12-22 13:31:31,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:31,689 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-22 13:31:31,690 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:31,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-22 13:31:31,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2021-12-22 13:31:31,690 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115
[2021-12-22 13:31:31,691 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 144 transitions, 1028 flow. Second operand  has 12 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 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)
[2021-12-22 13:31:31,691 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:31,691 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115
[2021-12-22 13:31:31,691 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:32,125 INFO  L129       PetriNetUnfolder]: 167/557 cut-off events.
[2021-12-22 13:31:32,126 INFO  L130       PetriNetUnfolder]: For 3644/5314 co-relation queries the response was YES.
[2021-12-22 13:31:32,128 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 557 events. 167/557 cut-off events. For 3644/5314 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2704 event pairs, 13 based on Foata normal form. 19/546 useless extension candidates. Maximal degree in co-relation 2609. Up to 186 conditions per place. 
[2021-12-22 13:31:32,131 INFO  L132   encePairwiseOnDemand]: 104/115 looper letters, 41 selfloop transitions, 38 changer transitions 43/195 dead transitions.
[2021-12-22 13:31:32,131 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 195 transitions, 1896 flow
[2021-12-22 13:31:32,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-22 13:31:32,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-22 13:31:32,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1465 transitions.
[2021-12-22 13:31:32,133 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7961956521739131
[2021-12-22 13:31:32,133 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1465 transitions.
[2021-12-22 13:31:32,133 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1465 transitions.
[2021-12-22 13:31:32,133 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:32,133 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1465 transitions.
[2021-12-22 13:31:32,135 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 91.5625) internal successors, (1465), 16 states have internal predecessors, (1465), 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)
[2021-12-22 13:31:32,136 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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)
[2021-12-22 13:31:32,136 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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)
[2021-12-22 13:31:32,136 INFO  L186             Difference]: Start difference. First operand has 160 places, 144 transitions, 1028 flow. Second operand 16 states and 1465 transitions.
[2021-12-22 13:31:32,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 195 transitions, 1896 flow
[2021-12-22 13:31:32,143 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 195 transitions, 1759 flow, removed 63 selfloop flow, removed 10 redundant places.
[2021-12-22 13:31:32,146 INFO  L242             Difference]: Finished difference. Result has 168 places, 145 transitions, 1134 flow
[2021-12-22 13:31:32,146 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1134, PETRI_PLACES=168, PETRI_TRANSITIONS=145}
[2021-12-22 13:31:32,146 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 48 predicate places.
[2021-12-22 13:31:32,146 INFO  L470      AbstractCegarLoop]: Abstraction has has 168 places, 145 transitions, 1134 flow
[2021-12-22 13:31:32,147 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 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)
[2021-12-22 13:31:32,147 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:32,147 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:32,147 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-22 13:31:32,147 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:32,148 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:32,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 1497667756, now seen corresponding path program 1 times
[2021-12-22 13:31:32,148 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:32,148 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506353975]
[2021-12-22 13:31:32,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:32,148 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:32,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:32,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:32,436 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:32,436 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506353975]
[2021-12-22 13:31:32,436 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506353975] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:32,436 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:32,436 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-22 13:31:32,436 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493612230]
[2021-12-22 13:31:32,436 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:32,437 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-22 13:31:32,437 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:32,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-22 13:31:32,437 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2021-12-22 13:31:32,438 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115
[2021-12-22 13:31:32,438 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 145 transitions, 1134 flow. Second operand  has 15 states, 15 states have (on average 85.6) internal successors, (1284), 15 states have internal predecessors, (1284), 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)
[2021-12-22 13:31:32,439 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:32,439 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115
[2021-12-22 13:31:32,439 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:32,902 INFO  L129       PetriNetUnfolder]: 137/556 cut-off events.
[2021-12-22 13:31:32,902 INFO  L130       PetriNetUnfolder]: For 4530/4995 co-relation queries the response was YES.
[2021-12-22 13:31:32,905 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 556 events. 137/556 cut-off events. For 4530/4995 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3251 event pairs, 16 based on Foata normal form. 24/568 useless extension candidates. Maximal degree in co-relation 2581. Up to 180 conditions per place. 
[2021-12-22 13:31:32,907 INFO  L132   encePairwiseOnDemand]: 103/115 looper letters, 44 selfloop transitions, 17 changer transitions 49/180 dead transitions.
[2021-12-22 13:31:32,907 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 180 transitions, 1763 flow
[2021-12-22 13:31:32,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-22 13:31:32,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-22 13:31:32,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1578 transitions.
[2021-12-22 13:31:32,913 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7623188405797101
[2021-12-22 13:31:32,913 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1578 transitions.
[2021-12-22 13:31:32,913 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1578 transitions.
[2021-12-22 13:31:32,914 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:32,914 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1578 transitions.
[2021-12-22 13:31:32,915 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 87.66666666666667) internal successors, (1578), 18 states have internal predecessors, (1578), 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)
[2021-12-22 13:31:32,917 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 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)
[2021-12-22 13:31:32,917 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 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)
[2021-12-22 13:31:32,917 INFO  L186             Difference]: Start difference. First operand has 168 places, 145 transitions, 1134 flow. Second operand 18 states and 1578 transitions.
[2021-12-22 13:31:32,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 180 transitions, 1763 flow
[2021-12-22 13:31:32,928 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 180 transitions, 1644 flow, removed 49 selfloop flow, removed 10 redundant places.
[2021-12-22 13:31:32,930 INFO  L242             Difference]: Finished difference. Result has 178 places, 126 transitions, 836 flow
[2021-12-22 13:31:32,930 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=836, PETRI_PLACES=178, PETRI_TRANSITIONS=126}
[2021-12-22 13:31:32,931 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 58 predicate places.
[2021-12-22 13:31:32,931 INFO  L470      AbstractCegarLoop]: Abstraction has has 178 places, 126 transitions, 836 flow
[2021-12-22 13:31:32,931 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 85.6) internal successors, (1284), 15 states have internal predecessors, (1284), 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)
[2021-12-22 13:31:32,931 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:32,931 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:32,931 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-22 13:31:32,932 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:32,932 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:32,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067868343, now seen corresponding path program 1 times
[2021-12-22 13:31:32,932 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:32,932 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450641065]
[2021-12-22 13:31:32,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:32,932 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:32,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:33,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:33,017 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:33,017 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450641065]
[2021-12-22 13:31:33,018 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450641065] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:33,018 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:33,018 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:33,018 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129263999]
[2021-12-22 13:31:33,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:33,019 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:33,019 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:33,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:33,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:33,020 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115
[2021-12-22 13:31:33,020 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 126 transitions, 836 flow. Second operand  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2021-12-22 13:31:33,021 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:33,021 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115
[2021-12-22 13:31:33,021 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:33,426 INFO  L129       PetriNetUnfolder]: 930/1935 cut-off events.
[2021-12-22 13:31:33,427 INFO  L130       PetriNetUnfolder]: For 18284/18292 co-relation queries the response was YES.
[2021-12-22 13:31:33,435 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8036 conditions, 1935 events. 930/1935 cut-off events. For 18284/18292 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11662 event pairs, 24 based on Foata normal form. 8/1903 useless extension candidates. Maximal degree in co-relation 7935. Up to 576 conditions per place. 
[2021-12-22 13:31:33,440 INFO  L132   encePairwiseOnDemand]: 105/115 looper letters, 61 selfloop transitions, 6 changer transitions 94/235 dead transitions.
[2021-12-22 13:31:33,441 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 235 transitions, 2445 flow
[2021-12-22 13:31:33,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:33,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:33,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions.
[2021-12-22 13:31:33,442 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8539130434782609
[2021-12-22 13:31:33,442 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 982 transitions.
[2021-12-22 13:31:33,442 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions.
[2021-12-22 13:31:33,443 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:33,443 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions.
[2021-12-22 13:31:33,444 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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)
[2021-12-22 13:31:33,445 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:33,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:33,445 INFO  L186             Difference]: Start difference. First operand has 178 places, 126 transitions, 836 flow. Second operand 10 states and 982 transitions.
[2021-12-22 13:31:33,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 235 transitions, 2445 flow
[2021-12-22 13:31:33,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 235 transitions, 1957 flow, removed 85 selfloop flow, removed 36 redundant places.
[2021-12-22 13:31:33,461 INFO  L242             Difference]: Finished difference. Result has 147 places, 115 transitions, 551 flow
[2021-12-22 13:31:33,461 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=551, PETRI_PLACES=147, PETRI_TRANSITIONS=115}
[2021-12-22 13:31:33,461 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 27 predicate places.
[2021-12-22 13:31:33,461 INFO  L470      AbstractCegarLoop]: Abstraction has has 147 places, 115 transitions, 551 flow
[2021-12-22 13:31:33,462 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2021-12-22 13:31:33,462 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:33,462 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:33,462 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-12-22 13:31:33,462 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:33,462 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:33,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -1697232895, now seen corresponding path program 1 times
[2021-12-22 13:31:33,463 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:33,463 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582411999]
[2021-12-22 13:31:33,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:33,463 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:33,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:33,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:33,554 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:33,554 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582411999]
[2021-12-22 13:31:33,554 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582411999] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:33,555 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:33,555 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-22 13:31:33,555 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8978871]
[2021-12-22 13:31:33,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:33,555 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-22 13:31:33,555 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:33,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-22 13:31:33,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-22 13:31:33,556 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115
[2021-12-22 13:31:33,557 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 115 transitions, 551 flow. Second operand  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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)
[2021-12-22 13:31:33,557 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:33,557 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115
[2021-12-22 13:31:33,557 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:33,820 INFO  L129       PetriNetUnfolder]: 310/864 cut-off events.
[2021-12-22 13:31:33,821 INFO  L130       PetriNetUnfolder]: For 4127/4137 co-relation queries the response was YES.
[2021-12-22 13:31:33,824 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3389 conditions, 864 events. 310/864 cut-off events. For 4127/4137 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4791 event pairs, 4 based on Foata normal form. 35/897 useless extension candidates. Maximal degree in co-relation 3309. Up to 212 conditions per place. 
[2021-12-22 13:31:33,826 INFO  L132   encePairwiseOnDemand]: 106/115 looper letters, 55 selfloop transitions, 9 changer transitions 54/192 dead transitions.
[2021-12-22 13:31:33,826 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 1545 flow
[2021-12-22 13:31:33,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:33,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:33,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions.
[2021-12-22 13:31:33,828 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8469565217391304
[2021-12-22 13:31:33,828 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 974 transitions.
[2021-12-22 13:31:33,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions.
[2021-12-22 13:31:33,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:33,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions.
[2021-12-22 13:31:33,829 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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)
[2021-12-22 13:31:33,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:33,831 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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)
[2021-12-22 13:31:33,831 INFO  L186             Difference]: Start difference. First operand has 147 places, 115 transitions, 551 flow. Second operand 10 states and 974 transitions.
[2021-12-22 13:31:33,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 1545 flow
[2021-12-22 13:31:33,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 192 transitions, 1473 flow, removed 17 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:33,839 INFO  L242             Difference]: Finished difference. Result has 148 places, 115 transitions, 564 flow
[2021-12-22 13:31:33,839 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=564, PETRI_PLACES=148, PETRI_TRANSITIONS=115}
[2021-12-22 13:31:33,839 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 28 predicate places.
[2021-12-22 13:31:33,840 INFO  L470      AbstractCegarLoop]: Abstraction has has 148 places, 115 transitions, 564 flow
[2021-12-22 13:31:33,840 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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)
[2021-12-22 13:31:33,840 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:33,840 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:33,840 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-12-22 13:31:33,840 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:33,841 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:33,841 INFO  L85        PathProgramCache]: Analyzing trace with hash 422057882, now seen corresponding path program 1 times
[2021-12-22 13:31:33,841 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:33,841 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425177639]
[2021-12-22 13:31:33,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:33,841 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:33,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:33,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 13:31:33,938 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:33,938 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425177639]
[2021-12-22 13:31:33,939 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425177639] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:33,939 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:33,939 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-22 13:31:33,939 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17745039]
[2021-12-22 13:31:33,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:33,939 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-22 13:31:33,939 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:33,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-22 13:31:33,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-22 13:31:33,940 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115
[2021-12-22 13:31:33,941 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 115 transitions, 564 flow. Second operand  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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)
[2021-12-22 13:31:33,941 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:33,941 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115
[2021-12-22 13:31:33,941 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:34,140 INFO  L129       PetriNetUnfolder]: 89/374 cut-off events.
[2021-12-22 13:31:34,141 INFO  L130       PetriNetUnfolder]: For 1634/1634 co-relation queries the response was YES.
[2021-12-22 13:31:34,142 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 374 events. 89/374 cut-off events. For 1634/1634 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1642 event pairs, 4 based on Foata normal form. 11/383 useless extension candidates. Maximal degree in co-relation 1372. Up to 77 conditions per place. 
[2021-12-22 13:31:34,143 INFO  L132   encePairwiseOnDemand]: 106/115 looper letters, 43 selfloop transitions, 12 changer transitions 25/154 dead transitions.
[2021-12-22 13:31:34,144 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 1118 flow
[2021-12-22 13:31:34,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-22 13:31:34,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-22 13:31:34,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions.
[2021-12-22 13:31:34,145 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8221343873517787
[2021-12-22 13:31:34,145 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions.
[2021-12-22 13:31:34,146 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions.
[2021-12-22 13:31:34,146 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:34,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions.
[2021-12-22 13:31:34,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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)
[2021-12-22 13:31:34,148 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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)
[2021-12-22 13:31:34,148 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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)
[2021-12-22 13:31:34,148 INFO  L186             Difference]: Start difference. First operand has 148 places, 115 transitions, 564 flow. Second operand 11 states and 1040 transitions.
[2021-12-22 13:31:34,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 1118 flow
[2021-12-22 13:31:34,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 154 transitions, 917 flow, removed 61 selfloop flow, removed 18 redundant places.
[2021-12-22 13:31:34,154 INFO  L242             Difference]: Finished difference. Result has 142 places, 113 transitions, 468 flow
[2021-12-22 13:31:34,154 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=468, PETRI_PLACES=142, PETRI_TRANSITIONS=113}
[2021-12-22 13:31:34,155 INFO  L334   CegarLoopForPetriNet]: 120 programPoint places, 22 predicate places.
[2021-12-22 13:31:34,155 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 113 transitions, 468 flow
[2021-12-22 13:31:34,155 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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)
[2021-12-22 13:31:34,155 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:34,155 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:34,155 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-12-22 13:31:34,156 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:34,156 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:34,156 INFO  L85        PathProgramCache]: Analyzing trace with hash -843819749, now seen corresponding path program 1 times
[2021-12-22 13:31:34,156 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:34,156 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414719560]
[2021-12-22 13:31:34,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:34,156 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:34,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 13:31:34,193 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 13:31:34,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 13:31:34,306 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 13:31:34,306 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-22 13:31:34,307 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2021-12-22 13:31:34,308 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2021-12-22 13:31:34,309 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2021-12-22 13:31:34,309 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2021-12-22 13:31:34,309 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2021-12-22 13:31:34,309 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2021-12-22 13:31:34,309 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-12-22 13:31:34,312 INFO  L732         BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:34,316 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-22 13:31:34,316 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-22 13:31:34,417 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:31:34 BasicIcfg
[2021-12-22 13:31:34,417 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-22 13:31:34,418 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-22 13:31:34,418 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-22 13:31:34,418 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-22 13:31:34,418 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:23" (3/4) ...
[2021-12-22 13:31:34,419 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-22 13:31:34,483 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-22 13:31:34,483 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-22 13:31:34,485 INFO  L158              Benchmark]: Toolchain (without parser) took 12233.67ms. Allocated memory was 111.1MB in the beginning and 373.3MB in the end (delta: 262.1MB). Free memory was 83.9MB in the beginning and 248.6MB in the end (delta: -164.8MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,486 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2021-12-22 13:31:34,486 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 455.73ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 83.5MB in the beginning and 105.7MB in the end (delta: -22.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,486 INFO  L158              Benchmark]: Boogie Procedure Inliner took 58.27ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 103.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,487 INFO  L158              Benchmark]: Boogie Preprocessor took 42.84ms. Allocated memory is still 146.8MB. Free memory was 103.0MB in the beginning and 99.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,487 INFO  L158              Benchmark]: RCFGBuilder took 1077.28ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 90.8MB in the end (delta: 9.1MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,487 INFO  L158              Benchmark]: TraceAbstraction took 10526.59ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 90.8MB in the beginning and 291.6MB in the end (delta: -200.8MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,487 INFO  L158              Benchmark]: Witness Printer took 67.54ms. Allocated memory is still 373.3MB. Free memory was 290.6MB in the beginning and 248.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2021-12-22 13:31:34,488 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 455.73ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 83.5MB in the beginning and 105.7MB in the end (delta: -22.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 58.27ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 103.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 42.84ms. Allocated memory is still 146.8MB. Free memory was 103.0MB in the beginning and 99.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1077.28ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 90.8MB in the end (delta: 9.1MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10526.59ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 90.8MB in the beginning and 291.6MB in the end (delta: -200.8MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB.
 * Witness Printer took 67.54ms. Allocated memory is still 373.3MB. Free memory was 290.6MB in the beginning and 248.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L713]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0]
[L715]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L716]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L717]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L719]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L721]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L722]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L723]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L724]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L725]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L726]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L727]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L728]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L729]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L730]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L731]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L732]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L733]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L734]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L735]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L736]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L737]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L738]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L739]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L846]               0  pthread_t t1849;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L847]  FCALL, FORK  0  pthread_create(&t1849, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L848]               0  pthread_t t1850;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L849]  FCALL, FORK  0  pthread_create(&t1850, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L850]               0  pthread_t t1851;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L851]  FCALL, FORK  0  pthread_create(&t1851, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L743]               1  y$w_buff1 = y$w_buff0
[L744]               1  y$w_buff0 = 2
[L745]               1  y$w_buff1_used = y$w_buff0_used
[L746]               1  y$w_buff0_used = (_Bool)1
[L747]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L747]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L749]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L750]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L751]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L752]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L755]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L772]               2  __unbuffered_p1_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L775]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L778]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L778]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L778]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L778]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L779]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L779]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L780]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L780]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L781]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L781]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L782]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L782]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L792]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L793]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L794]               3  y$flush_delayed = weak$$choice2
[L795]               3  y$mem_tmp = y
[L796]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L796]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L797]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L798]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L799]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L799]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L800]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L801]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L802]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L802]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803]               3  __unbuffered_p2_EAX = y
[L804]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L804]               3  y = y$flush_delayed ? y$mem_tmp : y
[L805]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L808]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L809]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L810]               3  y$flush_delayed = weak$$choice2
[L811]               3  y$mem_tmp = y
[L812]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L812]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L813]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L813]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L814]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L814]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L815]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L815]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L815]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L816]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L817]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L817]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L817]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L818]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L818]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L818]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]               3  __unbuffered_p2_EBX = y
[L820]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L820]               3  y = y$flush_delayed ? y$mem_tmp : y
[L821]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L824]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L824]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L824]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L824]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L825]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L825]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L826]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L826]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L827]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L827]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L828]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L828]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L758]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L758]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L759]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L760]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L761]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L762]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L785]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L765]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L831]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L853]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L855]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L855]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L857]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L857]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L858]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L859]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L860]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L860]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L861]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L861]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L864]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L865]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L866]               0  y$flush_delayed = weak$$choice2
[L867]               0  y$mem_tmp = y
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L868]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L869]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L869]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L870]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L870]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L871]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L871]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L871]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L871]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L872]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L872]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L873]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L873]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L873]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L874]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L874]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L876]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L876]               0  y = y$flush_delayed ? y$mem_tmp : y
[L877]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L879]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L18]                0  reach_error()
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 142 locations, 6 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: 10.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1028 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1028 mSDsluCounter, 944 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1618 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2874 IncrementalHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 186 mSDtfsCounter, 2874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1134occurred in iteration=14, InterpolantAutomatonStates: 208, 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.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1523 NumberOfCodeBlocks, 1523 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 7584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-12-22 13:31:34,523 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE