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


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


Checking for ERROR reachability
Using default analysis
Version 7b2dab56
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC --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 0b3e46c76b9a5fdc4b011321e78fe2b0d5bafbdf
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.0-7b2dab5
[2021-10-11 00:20:52,761 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:20:52,763 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:20:52,796 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:20:52,797 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:20:52,798 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:20:52,800 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:20:52,803 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:20:52,805 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:20:52,807 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:20:52,808 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:20:52,810 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:20:52,811 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:20:52,812 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:20:52,814 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:20:52,816 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:20:52,817 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:20:52,818 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:20:52,821 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:20:52,823 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:20:52,826 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:20:52,831 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:20:52,833 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:20:52,835 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:20:52,841 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:20:52,843 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:20:52,843 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:20:52,848 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:20:52,851 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:20:52,853 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:20:52,854 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:20:52,855 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:20:52,858 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:20:52,859 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:20:52,861 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:20:52,862 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:20:52,863 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:20:52,863 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:20:52,863 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:20:52,865 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:20:52,866 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:20:52,869 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:20:52,917 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-11 00:20:52,918 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:20:52,920 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:20:52,920 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-11 00:20:52,921 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-11 00:20:52,921 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:20:52,921 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-11 00:20:52,921 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-11 00:20:52,922 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-11 00:20:52,922 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-11 00:20:52,923 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:20:52,924 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:20:52,924 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:20:52,924 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-11 00:20:52,924 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-11 00:20:52,925 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-11 00:20:52,925 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:20:52,925 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:20:52,925 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-11 00:20:52,926 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-10-11 00:20:52,926 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:20:52,926 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:20:52,926 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:20:52,927 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:20:52,927 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-11 00:20:52,927 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:20:52,927 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:20:52,928 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-11 00:20:52,928 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC
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 -> 0b3e46c76b9a5fdc4b011321e78fe2b0d5bafbdf
[2021-10-11 00:20:53,225 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:20:53,254 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:20:53,258 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:20:53,260 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-11 00:20:53,261 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-11 00:20:53,262 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i
[2021-10-11 00:20:53,355 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/data/407ad142d/b7a9a313b87d4d42b8cb6fd80ce0a6ea/FLAGfac3ba144
[2021-10-11 00:20:53,909 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-11 00:20:53,910 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i
[2021-10-11 00:20:53,929 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/data/407ad142d/b7a9a313b87d4d42b8cb6fd80ce0a6ea/FLAGfac3ba144
[2021-10-11 00:20:54,212 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/data/407ad142d/b7a9a313b87d4d42b8cb6fd80ce0a6ea
[2021-10-11 00:20:54,214 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:20:54,216 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:20:54,219 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:20:54,219 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:20:54,223 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:20:54,224 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:54,226 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719ba906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54, skipping insertion in model container
[2021-10-11 00:20:54,227 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:54,235 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-11 00:20:54,282 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:20:54,483 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i[948,961]
[2021-10-11 00:20:54,760 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:20:54,775 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-11 00:20:54,797 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i[948,961]
[2021-10-11 00:20:54,853 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:20:54,943 INFO  L208         MainTranslator]: Completed translation
[2021-10-11 00:20:54,944 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54 WrapperNode
[2021-10-11 00:20:54,944 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:20:54,946 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:20:54,946 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:20:54,946 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:20:54,955 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:54,976 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,014 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:20:55,015 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:20:55,015 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:20:55,015 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:20:55,025 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,025 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,033 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,034 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,050 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,073 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,077 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
[2021-10-11 00:20:55,083 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:20:55,084 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:20:55,084 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:20:55,084 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:20:55,085 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:20:55,211 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:20:55,211 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:20:55,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:20:55,213 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:20:55,214 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:20:55,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:20:55,214 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:20:55,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:20:55,215 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:20:55,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:20:55,216 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:20:55,216 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:20:55,216 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:20:55,216 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:20:55,218 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-10-11 00:20:58,050 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:20:58,051 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:20:58,054 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58 BoogieIcfgContainer
[2021-10-11 00:20:58,055 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:20:58,057 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:20:58,057 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:20:58,061 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:20:58,062 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:54" (1/3) ...
[2021-10-11 00:20:58,063 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114871b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:58, skipping insertion in model container
[2021-10-11 00:20:58,063 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:54" (2/3) ...
[2021-10-11 00:20:58,063 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114871b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:58, skipping insertion in model container
[2021-10-11 00:20:58,064 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58" (3/3) ...
[2021-10-11 00:20:58,066 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix002_pso.opt.i
[2021-10-11 00:20:58,087 WARN  L169   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:20:58,087 INFO  L180   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:20:58,092 INFO  L192   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:20:58,093 INFO  L354   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:20:58,165 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,166 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,166 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,166 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,166 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,167 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,167 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,167 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,167 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,168 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,168 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,168 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,169 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,169 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,170 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,170 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,172 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,173 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,174 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,175 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,175 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,175 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,175 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,176 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,177 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,178 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,178 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,178 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,178 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,178 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,180 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,180 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,180 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,181 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,181 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,187 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,187 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,187 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,187 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,187 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,188 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,188 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,189 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,189 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,189 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,190 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,191 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,192 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,195 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,195 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,196 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,196 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,199 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,200 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,200 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,200 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,201 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,202 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,202 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,202 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,210 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,211 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,211 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,211 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,211 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,211 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,212 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,212 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,212 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,212 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,212 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,213 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,213 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,213 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,213 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,213 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,214 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,215 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,216 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,217 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,218 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,218 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,218 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,218 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,218 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,221 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,222 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,223 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,224 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,225 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,226 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,226 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,226 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,228 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,229 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,230 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,230 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,230 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,230 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,230 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,231 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,231 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,231 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,232 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,232 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,232 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,234 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,234 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,235 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,236 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,240 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,241 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,242 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,242 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,242 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,242 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,242 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,257 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,257 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,259 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,259 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,259 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:20:58,267 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:20:58,280 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-10-11 00:20:58,310 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:20:58,310 INFO  L378      AbstractCegarLoop]: Hoare is true
[2021-10-11 00:20:58,310 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:20:58,310 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:20:58,311 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:20:58,311 INFO  L382      AbstractCegarLoop]: Difference is false
[2021-10-11 00:20:58,311 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:20:58,311 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:20:58,326 INFO  L120   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:20:58,330 INFO  L135   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 225 flow
[2021-10-11 00:20:58,334 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 225 flow
[2021-10-11 00:20:58,335 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow
[2021-10-11 00:20:58,394 INFO  L129       PetriNetUnfolder]: 2/102 cut-off events.
[2021-10-11 00:20:58,394 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:20:58,399 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. 
[2021-10-11 00:20:58,402 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1862
[2021-10-11 00:20:58,691 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:20:58,691 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:58,693 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:58,694 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:58,695 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:20:58,696 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:58,876 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:20:58,876 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:58,878 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:58,878 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:58,880 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:20:58,881 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:59,767 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:20:59,767 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:20:59,770 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:20:59,771 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:20:59,772 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:20:59,773 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:20:59,775 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:20:59,776 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:20:59,779 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:59,780 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:59,783 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:59,783 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:59,785 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:59,785 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:20:59,849 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:59,850 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:20:59,853 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:20:59,854 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,237 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,238 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,238 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,239 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,240 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,240 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,257 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,257 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,259 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,259 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,260 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,260 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,280 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,281 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,284 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,284 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,286 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,286 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,289 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,290 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,292 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,292 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,295 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,295 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,412 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,413 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,414 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,414 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,415 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,415 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,437 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,437 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,438 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,439 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,440 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,440 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,441 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,442 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,452 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,453 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,454 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,455 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,457 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,457 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:00,461 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,462 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,464 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,464 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,479 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,479 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,576 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,576 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:21:00,579 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,579 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,640 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:00,640 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:00,642 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:00,643 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:00,644 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:00,644 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:00,645 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:00,646 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:00,649 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,649 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,650 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,651 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,652 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,653 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:00,953 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,953 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:21:00,956 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:00,956 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,034 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,034 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,039 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,039 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,040 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,040 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,042 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,042 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,044 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,045 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,047 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,047 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,048 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,048 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,098 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,098 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,099 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,099 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,101 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,102 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:01,104 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,104 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:01,126 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,126 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,127 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,127 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,129 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,130 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:01,132 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,132 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:01,603 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:21:01,604 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,681 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,681 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:21:01,684 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,685 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,751 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,752 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,754 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,755 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,757 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,758 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,759 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,759 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,761 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,762 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,764 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,765 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,766 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,766 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,901 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:01,902 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:01,909 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,910 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,912 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,912 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,913 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:01,914 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:01,916 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,916 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,918 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,919 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,920 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,920 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:01,971 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,971 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:21:01,974 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:01,974 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:02,138 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,139 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:02,140 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,140 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:02,142 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,142 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:02,144 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,145 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:02,175 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,176 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:02,176 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,177 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:02,179 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,179 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:02,181 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:02,182 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:02,547 WARN  L197               SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2021-10-11 00:21:03,146 WARN  L197               SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86
[2021-10-11 00:21:03,302 WARN  L197               SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2021-10-11 00:21:03,779 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,780 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:03,782 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,783 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:03,828 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:03,829 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:03,832 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,833 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:03,834 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,834 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:03,835 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,835 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:03,837 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,838 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:03,839 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,839 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:03,841 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,841 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:03,938 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,938 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:03,940 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:03,940 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:03,992 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:03,992 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:03,996 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,996 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:03,997 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,997 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:03,998 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:03,999 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,001 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,001 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,002 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,003 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,004 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,004 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,048 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,048 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,049 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,049 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,050 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,051 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,052 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,053 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,069 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,070 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,070 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,071 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,073 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,073 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:04,075 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,075 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:04,179 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,179 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,181 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,181 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,182 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,183 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,184 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,184 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,186 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,186 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,188 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,189 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,190 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,190 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,234 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,234 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:04,236 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,236 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,286 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,287 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,288 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,289 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,290 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,290 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,291 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:21:04,291 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:21:04,293 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,294 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,295 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,295 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,296 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,297 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,342 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,342 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:21:04,344 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:21:04,345 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,544 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,545 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,545 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,546 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,549 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,550 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:04,551 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,551 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:21:04,565 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,566 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,567 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,567 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:21:04,568 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,569 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,570 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:21:04,570 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:21:04,981 WARN  L197               SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52
[2021-10-11 00:21:05,157 WARN  L197               SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52
[2021-10-11 00:21:05,654 WARN  L197               SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2021-10-11 00:21:05,861 WARN  L197               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2021-10-11 00:21:06,341 WARN  L197               SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:21:06,526 WARN  L197               SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:21:06,944 WARN  L197               SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:21:07,132 WARN  L197               SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:21:07,137 INFO  L131        LiptonReduction]: Checked pairs total: 5583
[2021-10-11 00:21:07,137 INFO  L133        LiptonReduction]: Total number of compositions: 88
[2021-10-11 00:21:07,144 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2021-10-11 00:21:07,216 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1112 states.
[2021-10-11 00:21:07,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 1112 states.
[2021-10-11 00:21:07,223 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2021-10-11 00:21:07,224 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:07,224 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:07,225 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:07,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:07,230 INFO  L82        PathProgramCache]: Analyzing trace with hash -1415861178, now seen corresponding path program 1 times
[2021-10-11 00:21:07,239 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:07,240 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692291252]
[2021-10-11 00:21:07,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:07,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:07,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:07,463 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692291252]
[2021-10-11 00:21:07,464 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:07,464 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:21:07,464 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797325297]
[2021-10-11 00:21:07,468 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:21:07,469 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:07,481 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:21:07,482 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:21:07,483 INFO  L87              Difference]: Start difference. First operand 1112 states. Second operand 3 states.
[2021-10-11 00:21:07,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:07,573 INFO  L93              Difference]: Finished difference Result 962 states and 3090 transitions.
[2021-10-11 00:21:07,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-11 00:21:07,575 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2021-10-11 00:21:07,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:07,601 INFO  L225             Difference]: With dead ends: 962
[2021-10-11 00:21:07,601 INFO  L226             Difference]: Without dead ends: 812
[2021-10-11 00:21:07,602 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:21:07,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 812 states.
[2021-10-11 00:21:07,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812.
[2021-10-11 00:21:07,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 812 states.
[2021-10-11 00:21:07,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions.
[2021-10-11 00:21:07,714 INFO  L78                 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 7
[2021-10-11 00:21:07,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:07,715 INFO  L481      AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions.
[2021-10-11 00:21:07,715 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:21:07,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions.
[2021-10-11 00:21:07,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-10-11 00:21:07,717 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:07,718 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:07,718 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:21:07,718 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:07,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:07,719 INFO  L82        PathProgramCache]: Analyzing trace with hash 956056239, now seen corresponding path program 1 times
[2021-10-11 00:21:07,719 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:07,719 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567572749]
[2021-10-11 00:21:07,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:07,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:07,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:07,867 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567572749]
[2021-10-11 00:21:07,867 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:07,867 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:21:07,868 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773456917]
[2021-10-11 00:21:07,869 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:21:07,869 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:07,870 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:21:07,870 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:21:07,870 INFO  L87              Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states.
[2021-10-11 00:21:07,964 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:07,964 INFO  L93              Difference]: Finished difference Result 946 states and 2884 transitions.
[2021-10-11 00:21:07,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:07,966 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2021-10-11 00:21:07,966 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:07,976 INFO  L225             Difference]: With dead ends: 946
[2021-10-11 00:21:07,976 INFO  L226             Difference]: Without dead ends: 796
[2021-10-11 00:21:07,977 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:07,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 796 states.
[2021-10-11 00:21:08,016 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796.
[2021-10-11 00:21:08,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 796 states.
[2021-10-11 00:21:08,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2511 transitions.
[2021-10-11 00:21:08,023 INFO  L78                 Accepts]: Start accepts. Automaton has 796 states and 2511 transitions. Word has length 10
[2021-10-11 00:21:08,023 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,023 INFO  L481      AbstractCegarLoop]: Abstraction has 796 states and 2511 transitions.
[2021-10-11 00:21:08,024 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:21:08,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 796 states and 2511 transitions.
[2021-10-11 00:21:08,032 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-10-11 00:21:08,032 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,032 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,032 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:21:08,033 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,038 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,038 INFO  L82        PathProgramCache]: Analyzing trace with hash 124927017, now seen corresponding path program 1 times
[2021-10-11 00:21:08,038 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,039 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257998369]
[2021-10-11 00:21:08,039 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:08,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:08,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:08,140 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257998369]
[2021-10-11 00:21:08,140 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:08,140 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:21:08,140 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878401197]
[2021-10-11 00:21:08,141 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:21:08,141 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:08,153 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:21:08,153 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:21:08,153 INFO  L87              Difference]: Start difference. First operand 796 states and 2511 transitions. Second operand 4 states.
[2021-10-11 00:21:08,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:08,184 INFO  L93              Difference]: Finished difference Result 822 states and 2500 transitions.
[2021-10-11 00:21:08,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:08,184 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2021-10-11 00:21:08,185 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:08,191 INFO  L225             Difference]: With dead ends: 822
[2021-10-11 00:21:08,192 INFO  L226             Difference]: Without dead ends: 692
[2021-10-11 00:21:08,192 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:08,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 692 states.
[2021-10-11 00:21:08,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692.
[2021-10-11 00:21:08,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 692 states.
[2021-10-11 00:21:08,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2139 transitions.
[2021-10-11 00:21:08,221 INFO  L78                 Accepts]: Start accepts. Automaton has 692 states and 2139 transitions. Word has length 12
[2021-10-11 00:21:08,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,222 INFO  L481      AbstractCegarLoop]: Abstraction has 692 states and 2139 transitions.
[2021-10-11 00:21:08,222 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:21:08,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 692 states and 2139 transitions.
[2021-10-11 00:21:08,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-10-11 00:21:08,280 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,280 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,280 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:21:08,280 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,281 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,281 INFO  L82        PathProgramCache]: Analyzing trace with hash -352182661, now seen corresponding path program 1 times
[2021-10-11 00:21:08,281 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,281 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537524179]
[2021-10-11 00:21:08,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:08,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:08,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:08,345 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537524179]
[2021-10-11 00:21:08,345 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:08,345 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:21:08,345 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451490934]
[2021-10-11 00:21:08,346 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:21:08,346 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:08,346 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:21:08,347 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:21:08,347 INFO  L87              Difference]: Start difference. First operand 692 states and 2139 transitions. Second operand 4 states.
[2021-10-11 00:21:08,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:08,374 INFO  L93              Difference]: Finished difference Result 710 states and 2130 transitions.
[2021-10-11 00:21:08,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:08,375 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2021-10-11 00:21:08,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:08,381 INFO  L225             Difference]: With dead ends: 710
[2021-10-11 00:21:08,381 INFO  L226             Difference]: Without dead ends: 620
[2021-10-11 00:21:08,382 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:08,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 620 states.
[2021-10-11 00:21:08,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620.
[2021-10-11 00:21:08,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 620 states.
[2021-10-11 00:21:08,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1887 transitions.
[2021-10-11 00:21:08,406 INFO  L78                 Accepts]: Start accepts. Automaton has 620 states and 1887 transitions. Word has length 12
[2021-10-11 00:21:08,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,407 INFO  L481      AbstractCegarLoop]: Abstraction has 620 states and 1887 transitions.
[2021-10-11 00:21:08,407 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:21:08,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 620 states and 1887 transitions.
[2021-10-11 00:21:08,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-10-11 00:21:08,409 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,409 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,409 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:21:08,409 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,410 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,410 INFO  L82        PathProgramCache]: Analyzing trace with hash -203447947, now seen corresponding path program 1 times
[2021-10-11 00:21:08,410 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,410 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329023744]
[2021-10-11 00:21:08,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:08,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:08,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:08,463 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329023744]
[2021-10-11 00:21:08,463 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:08,464 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:21:08,464 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923730835]
[2021-10-11 00:21:08,465 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:21:08,465 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:08,466 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:21:08,466 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:21:08,467 INFO  L87              Difference]: Start difference. First operand 620 states and 1887 transitions. Second operand 4 states.
[2021-10-11 00:21:08,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:08,508 INFO  L93              Difference]: Finished difference Result 638 states and 1902 transitions.
[2021-10-11 00:21:08,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:08,509 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2021-10-11 00:21:08,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:08,515 INFO  L225             Difference]: With dead ends: 638
[2021-10-11 00:21:08,515 INFO  L226             Difference]: Without dead ends: 584
[2021-10-11 00:21:08,515 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:08,518 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 584 states.
[2021-10-11 00:21:08,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584.
[2021-10-11 00:21:08,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 584 states.
[2021-10-11 00:21:08,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1767 transitions.
[2021-10-11 00:21:08,539 INFO  L78                 Accepts]: Start accepts. Automaton has 584 states and 1767 transitions. Word has length 14
[2021-10-11 00:21:08,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,539 INFO  L481      AbstractCegarLoop]: Abstraction has 584 states and 1767 transitions.
[2021-10-11 00:21:08,539 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:21:08,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 584 states and 1767 transitions.
[2021-10-11 00:21:08,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:21:08,541 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,541 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,542 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:21:08,542 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,542 INFO  L82        PathProgramCache]: Analyzing trace with hash -1902874536, now seen corresponding path program 1 times
[2021-10-11 00:21:08,543 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,543 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253737111]
[2021-10-11 00:21:08,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:08,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:08,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:08,749 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253737111]
[2021-10-11 00:21:08,749 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:08,749 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:21:08,749 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240509066]
[2021-10-11 00:21:08,750 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:21:08,750 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:08,751 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:21:08,751 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:21:08,751 INFO  L87              Difference]: Start difference. First operand 584 states and 1767 transitions. Second operand 4 states.
[2021-10-11 00:21:08,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:08,794 INFO  L93              Difference]: Finished difference Result 550 states and 1476 transitions.
[2021-10-11 00:21:08,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:08,795 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2021-10-11 00:21:08,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:08,799 INFO  L225             Difference]: With dead ends: 550
[2021-10-11 00:21:08,799 INFO  L226             Difference]: Without dead ends: 400
[2021-10-11 00:21:08,799 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:08,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2021-10-11 00:21:08,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400.
[2021-10-11 00:21:08,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 400 states.
[2021-10-11 00:21:08,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1031 transitions.
[2021-10-11 00:21:08,814 INFO  L78                 Accepts]: Start accepts. Automaton has 400 states and 1031 transitions. Word has length 16
[2021-10-11 00:21:08,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,814 INFO  L481      AbstractCegarLoop]: Abstraction has 400 states and 1031 transitions.
[2021-10-11 00:21:08,814 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:21:08,815 INFO  L276                IsEmpty]: Start isEmpty. Operand 400 states and 1031 transitions.
[2021-10-11 00:21:08,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2021-10-11 00:21:08,816 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,816 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,816 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:21:08,816 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,817 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,817 INFO  L82        PathProgramCache]: Analyzing trace with hash -673635968, now seen corresponding path program 1 times
[2021-10-11 00:21:08,817 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,817 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926042216]
[2021-10-11 00:21:08,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:08,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:08,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:08,912 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926042216]
[2021-10-11 00:21:08,912 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:08,912 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:21:08,913 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210089815]
[2021-10-11 00:21:08,913 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:21:08,913 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:08,914 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:21:08,914 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:08,914 INFO  L87              Difference]: Start difference. First operand 400 states and 1031 transitions. Second operand 5 states.
[2021-10-11 00:21:08,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:08,968 INFO  L93              Difference]: Finished difference Result 326 states and 780 transitions.
[2021-10-11 00:21:08,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-11 00:21:08,969 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2021-10-11 00:21:08,970 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:08,972 INFO  L225             Difference]: With dead ends: 326
[2021-10-11 00:21:08,972 INFO  L226             Difference]: Without dead ends: 256
[2021-10-11 00:21:08,972 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:21:08,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2021-10-11 00:21:08,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256.
[2021-10-11 00:21:08,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2021-10-11 00:21:08,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 599 transitions.
[2021-10-11 00:21:08,981 INFO  L78                 Accepts]: Start accepts. Automaton has 256 states and 599 transitions. Word has length 18
[2021-10-11 00:21:08,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:08,981 INFO  L481      AbstractCegarLoop]: Abstraction has 256 states and 599 transitions.
[2021-10-11 00:21:08,981 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:21:08,982 INFO  L276                IsEmpty]: Start isEmpty. Operand 256 states and 599 transitions.
[2021-10-11 00:21:08,983 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:21:08,983 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:08,983 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:21:08,983 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:21:08,983 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:08,984 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:08,984 INFO  L82        PathProgramCache]: Analyzing trace with hash 649733947, now seen corresponding path program 1 times
[2021-10-11 00:21:08,984 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:08,984 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672647744]
[2021-10-11 00:21:08,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:09,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:09,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-10-11 00:21:09,138 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672647744]
[2021-10-11 00:21:09,138 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:09,139 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:21:09,139 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792182676]
[2021-10-11 00:21:09,139 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:21:09,139 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:09,140 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:21:09,140 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:21:09,140 INFO  L87              Difference]: Start difference. First operand 256 states and 599 transitions. Second operand 6 states.
[2021-10-11 00:21:09,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:09,203 INFO  L93              Difference]: Finished difference Result 230 states and 545 transitions.
[2021-10-11 00:21:09,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-10-11 00:21:09,204 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2021-10-11 00:21:09,204 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:09,206 INFO  L225             Difference]: With dead ends: 230
[2021-10-11 00:21:09,206 INFO  L226             Difference]: Without dead ends: 216
[2021-10-11 00:21:09,207 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:21:09,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2021-10-11 00:21:09,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216.
[2021-10-11 00:21:09,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 216 states.
[2021-10-11 00:21:09,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 519 transitions.
[2021-10-11 00:21:09,214 INFO  L78                 Accepts]: Start accepts. Automaton has 216 states and 519 transitions. Word has length 20
[2021-10-11 00:21:09,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:09,214 INFO  L481      AbstractCegarLoop]: Abstraction has 216 states and 519 transitions.
[2021-10-11 00:21:09,214 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:21:09,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 216 states and 519 transitions.
[2021-10-11 00:21:09,215 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:21:09,216 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:09,216 INFO  L422         BasicCegarLoop]: 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]
[2021-10-11 00:21:09,216 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:21:09,216 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:09,217 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:09,217 INFO  L82        PathProgramCache]: Analyzing trace with hash -1569323557, now seen corresponding path program 1 times
[2021-10-11 00:21:09,217 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:09,217 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237145268]
[2021-10-11 00:21:09,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:09,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:09,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:09,302 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237145268]
[2021-10-11 00:21:09,302 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:09,302 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:21:09,302 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138859415]
[2021-10-11 00:21:09,303 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:21:09,303 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:09,303 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:21:09,304 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:21:09,304 INFO  L87              Difference]: Start difference. First operand 216 states and 519 transitions. Second operand 5 states.
[2021-10-11 00:21:09,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:09,336 INFO  L93              Difference]: Finished difference Result 279 states and 655 transitions.
[2021-10-11 00:21:09,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:21:09,337 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2021-10-11 00:21:09,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:09,338 INFO  L225             Difference]: With dead ends: 279
[2021-10-11 00:21:09,338 INFO  L226             Difference]: Without dead ends: 108
[2021-10-11 00:21:09,339 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:21:09,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2021-10-11 00:21:09,341 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108.
[2021-10-11 00:21:09,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2021-10-11 00:21:09,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 223 transitions.
[2021-10-11 00:21:09,343 INFO  L78                 Accepts]: Start accepts. Automaton has 108 states and 223 transitions. Word has length 23
[2021-10-11 00:21:09,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:09,343 INFO  L481      AbstractCegarLoop]: Abstraction has 108 states and 223 transitions.
[2021-10-11 00:21:09,343 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:21:09,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 108 states and 223 transitions.
[2021-10-11 00:21:09,344 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:21:09,344 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:09,344 INFO  L422         BasicCegarLoop]: 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]
[2021-10-11 00:21:09,344 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:21:09,345 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:09,345 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:09,345 INFO  L82        PathProgramCache]: Analyzing trace with hash -675490853, now seen corresponding path program 2 times
[2021-10-11 00:21:09,345 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:09,346 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246002]
[2021-10-11 00:21:09,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:09,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:21:09,830 WARN  L197               SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 31
[2021-10-11 00:21:09,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:21:09,908 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246002]
[2021-10-11 00:21:09,908 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:21:09,908 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:21:09,909 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026143113]
[2021-10-11 00:21:09,909 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-10-11 00:21:09,909 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:21:09,910 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-11 00:21:09,910 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:21:09,910 INFO  L87              Difference]: Start difference. First operand 108 states and 223 transitions. Second operand 8 states.
[2021-10-11 00:21:10,151 WARN  L197               SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36
[2021-10-11 00:21:10,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:21:10,346 INFO  L93              Difference]: Finished difference Result 133 states and 265 transitions.
[2021-10-11 00:21:10,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-10-11 00:21:10,346 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2021-10-11 00:21:10,347 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:21:10,347 INFO  L225             Difference]: With dead ends: 133
[2021-10-11 00:21:10,347 INFO  L226             Difference]: Without dead ends: 80
[2021-10-11 00:21:10,348 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2021-10-11 00:21:10,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2021-10-11 00:21:10,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78.
[2021-10-11 00:21:10,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2021-10-11 00:21:10,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions.
[2021-10-11 00:21:10,351 INFO  L78                 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 23
[2021-10-11 00:21:10,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:21:10,351 INFO  L481      AbstractCegarLoop]: Abstraction has 78 states and 139 transitions.
[2021-10-11 00:21:10,351 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2021-10-11 00:21:10,352 INFO  L276                IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions.
[2021-10-11 00:21:10,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:21:10,352 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:21:10,352 INFO  L422         BasicCegarLoop]: 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]
[2021-10-11 00:21:10,352 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:21:10,353 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:21:10,353 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:21:10,354 INFO  L82        PathProgramCache]: Analyzing trace with hash -173327055, now seen corresponding path program 3 times
[2021-10-11 00:21:10,354 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:21:10,354 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830566786]
[2021-10-11 00:21:10,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:21:10,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:21:10,409 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:21:10,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:21:10,463 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:21:10,500 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:21:10,500 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:21:10,500 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-11 00:21:10,597 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:10 BasicIcfg
[2021-10-11 00:21:10,597 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:21:10,598 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:21:10,598 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:21:10,598 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-11 00:21:10,599 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58" (3/4) ...
[2021-10-11 00:21:10,601 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:21:10,717 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a611e3-a386-450a-a4e7-d136fc4c21e5/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:21:10,717 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:21:10,718 INFO  L168              Benchmark]: Toolchain (without parser) took 16501.57 ms. Allocated memory was 86.0 MB in the beginning and 417.3 MB in the end (delta: 331.4 MB). Free memory was 51.3 MB in the beginning and 228.3 MB in the end (delta: -177.0 MB). Peak memory consumption was 152.6 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,718 INFO  L168              Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 86.0 MB. Free memory was 57.0 MB in the beginning and 57.0 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,718 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 725.71 ms. Allocated memory was 86.0 MB in the beginning and 117.4 MB in the end (delta: 31.5 MB). Free memory was 51.1 MB in the beginning and 69.4 MB in the end (delta: -18.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,719 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 117.4 MB. Free memory was 69.4 MB in the beginning and 66.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,719 INFO  L168              Benchmark]: Boogie Preprocessor took 68.18 ms. Allocated memory is still 117.4 MB. Free memory was 66.7 MB in the beginning and 64.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,719 INFO  L168              Benchmark]: RCFGBuilder took 2971.40 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 64.6 MB in the beginning and 103.9 MB in the end (delta: -39.3 MB). Peak memory consumption was 51.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,720 INFO  L168              Benchmark]: TraceAbstraction took 12540.78 ms. Allocated memory was 142.6 MB in the beginning and 417.3 MB in the end (delta: 274.7 MB). Free memory was 102.8 MB in the beginning and 248.2 MB in the end (delta: -145.4 MB). Peak memory consumption was 129.4 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,720 INFO  L168              Benchmark]: Witness Printer took 118.76 ms. Allocated memory is still 417.3 MB. Free memory was 248.2 MB in the beginning and 228.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:21:10,722 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.64 ms. Allocated memory is still 86.0 MB. Free memory was 57.0 MB in the beginning and 57.0 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 725.71 ms. Allocated memory was 86.0 MB in the beginning and 117.4 MB in the end (delta: 31.5 MB). Free memory was 51.1 MB in the beginning and 69.4 MB in the end (delta: -18.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 117.4 MB. Free memory was 69.4 MB in the beginning and 66.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 68.18 ms. Allocated memory is still 117.4 MB. Free memory was 66.7 MB in the beginning and 64.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 2971.40 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 64.6 MB in the beginning and 103.9 MB in the end (delta: -39.3 MB). Peak memory consumption was 51.2 MB. Max. memory is 16.1 GB.
 * TraceAbstraction took 12540.78 ms. Allocated memory was 142.6 MB in the beginning and 417.3 MB in the end (delta: 274.7 MB). Free memory was 102.8 MB in the beginning and 248.2 MB in the end (delta: -145.4 MB). Peak memory consumption was 129.4 MB. Max. memory is 16.1 GB.
 * Witness Printer took 118.76 ms. Allocated memory is still 417.3 MB. Free memory was 248.2 MB in the beginning and 228.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1378 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 226 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 113 PlacesBefore, 38 PlacesAfterwards, 105 TransitionsBefore, 29 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 5583 MoverChecksTotal
  - 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;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p0_EBX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p1_EBX = 0;
[L719]               0  int __unbuffered_p2_EAX = 0;
[L721]               0  int __unbuffered_p2_EBX = 0;
[L723]               0  int a = 0;
[L724]               0  _Bool main$tmp_guard0;
[L725]               0  _Bool main$tmp_guard1;
[L727]               0  int x = 0;
[L729]               0  int y = 0;
[L731]               0  int z = 0;
[L732]               0  _Bool z$flush_delayed;
[L733]               0  int z$mem_tmp;
[L734]               0  _Bool z$r_buff0_thd0;
[L735]               0  _Bool z$r_buff0_thd1;
[L736]               0  _Bool z$r_buff0_thd2;
[L737]               0  _Bool z$r_buff0_thd3;
[L738]               0  _Bool z$r_buff1_thd0;
[L739]               0  _Bool z$r_buff1_thd1;
[L740]               0  _Bool z$r_buff1_thd2;
[L741]               0  _Bool z$r_buff1_thd3;
[L742]               0  _Bool z$read_delayed;
[L743]               0  int *z$read_delayed_var;
[L744]               0  int z$w_buff0;
[L745]               0  _Bool z$w_buff0_used;
[L746]               0  int z$w_buff1;
[L747]               0  _Bool z$w_buff1_used;
[L748]               0  _Bool weak$$choice0;
[L749]               0  _Bool weak$$choice2;
[L858]               0  pthread_t t47;
[L859]  FCALL, FORK  0  pthread_create(&t47, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L860]               0  pthread_t t48;
[L861]  FCALL, FORK  0  pthread_create(&t48, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L862]               0  pthread_t t49;
[L863]  FCALL, FORK  0  pthread_create(&t49, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L805]               3  z$w_buff1 = z$w_buff0
[L806]               3  z$w_buff0 = 1
[L807]               3  z$w_buff1_used = z$w_buff0_used
[L808]               3  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   3  !(!expression)
[L810]               3  z$r_buff1_thd0 = z$r_buff0_thd0
[L811]               3  z$r_buff1_thd1 = z$r_buff0_thd1
[L812]               3  z$r_buff1_thd2 = z$r_buff0_thd2
[L813]               3  z$r_buff1_thd3 = z$r_buff0_thd3
[L814]               3  z$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L817]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L818]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L819]               3  z$flush_delayed = weak$$choice2
[L820]               3  z$mem_tmp = z
[L821]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L821]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1
[L821]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L821]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L822]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L823]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L823]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L824]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L824]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L825]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L826]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L827]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L828]               3  __unbuffered_p2_EAX = z
[L829]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L829]               3  z = z$flush_delayed ? z$mem_tmp : z
[L830]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L833]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]               1  a = 1
[L756]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L759]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L762]               1  __unbuffered_p0_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L767]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               1  return 0;
[L774]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777]               2  __unbuffered_p1_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L780]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L781]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L782]               2  z$flush_delayed = weak$$choice2
[L783]               2  z$mem_tmp = z
[L784]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L784]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L785]  EXPR         2  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L785]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)
[L785]  EXPR         2  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L785]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L786]  EXPR         2  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L786]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)
[L786]  EXPR         2  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L786]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L787]  EXPR         2  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L787]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)
[L787]  EXPR         2  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L787]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L788]  EXPR         2  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L788]  EXPR         2  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L789]  EXPR         2  weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L789]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)
[L789]  EXPR         2  weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L789]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L790]  EXPR         2  weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L790]  EXPR         2  weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L791]               2  __unbuffered_p1_EBX = z
[L792]  EXPR         2  z$flush_delayed ? z$mem_tmp : z
[L792]               2  z = z$flush_delayed ? z$mem_tmp : z
[L793]               2  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L836]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L836]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L837]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L837]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L838]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L838]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L839]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L839]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L840]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L840]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L843]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L845]               3  return 0;
[L798]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L800]               2  return 0;
[L865]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L869]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L869]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L869]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L869]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L870]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L870]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L871]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L871]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L872]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L872]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L873]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L873]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L876]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 311 SDtfs, 308 SDslu, 573 SDs, 0 SdLazy, 172 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1112occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 14777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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!
Received shutdown request...