/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i


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


This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 15:51:05,902 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-01 15:51:05,905 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 15:51:05,943 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 15:51:05,944 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 15:51:05,947 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 15:51:05,949 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 15:51:05,955 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 15:51:05,957 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 15:51:05,961 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 15:51:05,962 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 15:51:05,963 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 15:51:05,963 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 15:51:05,965 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 15:51:05,966 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 15:51:05,967 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 15:51:05,970 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 15:51:05,970 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 15:51:05,972 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 15:51:05,978 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 15:51:05,979 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 15:51:05,981 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 15:51:05,982 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 15:51:05,983 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 15:51:05,984 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 15:51:05,985 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 15:51:05,985 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 15:51:05,985 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 15:51:05,986 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 15:51:05,986 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 15:51:05,987 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 15:51:05,987 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 15:51:05,988 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 15:51:05,988 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 15:51:05,989 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 15:51:05,989 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 15:51:05,990 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 15:51:05,990 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 15:51:05,990 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 15:51:05,990 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 15:51:05,991 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 15:51:05,992 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-01 15:51:06,010 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-01 15:51:06,010 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 15:51:06,010 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 15:51:06,011 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 15:51:06,012 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-01 15:51:06,012 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-01 15:51:06,012 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-01 15:51:06,013 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-01 15:51:06,013 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:51:06,014 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 15:51:06,014 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-01 15:51:06,015 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 15:51:06,015 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-01 15:51:06,015 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 15:51:06,015 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-01 15:51:06,318 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 15:51:06,334 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 15:51:06,337 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 15:51:06,338 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-01 15:51:06,338 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-01 15:51:06,339 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i
[2021-06-01 15:51:06,393 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bafc3c92f/544809073dae452eb8d1378dda43a887/FLAG375d41bd5
[2021-06-01 15:51:06,840 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-01 15:51:06,840 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i
[2021-06-01 15:51:06,859 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bafc3c92f/544809073dae452eb8d1378dda43a887/FLAG375d41bd5
[2021-06-01 15:51:07,148 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bafc3c92f/544809073dae452eb8d1378dda43a887
[2021-06-01 15:51:07,151 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 15:51:07,152 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 15:51:07,156 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 15:51:07,156 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 15:51:07,159 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 15:51:07,160 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,161 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31751ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07, skipping insertion in model container
[2021-06-01 15:51:07,162 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,167 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-01 15:51:07,218 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-01 15:51:07,339 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i[991,1004]
[2021-06-01 15:51:07,558 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:51:07,565 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-01 15:51:07,578 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i[991,1004]
[2021-06-01 15:51:07,608 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:51:07,662 INFO  L208         MainTranslator]: Completed translation
[2021-06-01 15:51:07,662 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07 WrapperNode
[2021-06-01 15:51:07,662 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 15:51:07,663 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 15:51:07,663 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 15:51:07,663 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 15:51:07,669 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,682 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,702 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 15:51:07,703 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 15:51:07,703 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 15:51:07,703 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 15:51:07,710 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,710 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,713 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,713 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,722 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,725 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,727 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
[2021-06-01 15:51:07,730 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 15:51:07,731 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 15:51:07,731 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 15:51:07,731 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-01 15:51:07,732 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-06-01 15:51:07,802 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 15:51:07,802 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 15:51:07,803 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 15:51:07,803 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 15:51:07,803 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 15:51:07,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 15:51:07,803 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 15:51:07,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 15:51:07,803 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 15:51:07,804 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 15:51:07,804 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 15:51:07,804 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 15:51:07,809 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 15:51:09,740 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 15:51:09,741 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 15:51:09,743 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:51:09 BoogieIcfgContainer
[2021-06-01 15:51:09,743 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 15:51:09,746 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 15:51:09,747 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 15:51:09,749 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-01 15:51:09,750 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 03:51:07" (1/3) ...
[2021-06-01 15:51:09,751 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308dd9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:51:09, skipping insertion in model container
[2021-06-01 15:51:09,751 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:51:07" (2/3) ...
[2021-06-01 15:51:09,751 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308dd9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:51:09, skipping insertion in model container
[2021-06-01 15:51:09,751 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:51:09" (3/3) ...
[2021-06-01 15:51:09,752 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix034_tso.opt.i
[2021-06-01 15:51:09,758 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 15:51:09,758 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 15:51:09,759 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 15:51:09,759 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 15:51:09,793 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,794 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,798 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,801 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,802 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,803 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,804 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,807 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,807 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,807 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,807 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,808 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,809 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,810 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,811 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,812 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,812 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,812 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,812 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,814 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,815 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,816 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,817 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,817 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,817 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,817 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,819 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,819 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,819 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,820 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:51:09,822 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 15:51:09,840 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:51:09,858 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:51:09,858 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 15:51:09,858 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:51:09,858 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:51:09,859 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:51:09,859 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 15:51:09,859 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:51:09,859 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-01 15:51:09,867 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 90 transitions, 190 flow
[2021-06-01 15:51:09,960 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:09,967 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,002 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:51:10,003 INFO  L301   ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-01 15:51:10,004 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2021-06-01 15:51:10,007 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:51:10,007 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 15:51:10,007 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:51:10,007 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:51:10,007 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:51:10,007 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 15:51:10,007 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:51:10,007 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 15:51:10,010 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 90 transitions, 190 flow
[2021-06-01 15:51:10,056 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,061 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,064 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2021-06-01 15:51:10,065 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:10,065 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:10,066 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:10,070 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:10,070 INFO  L82        PathProgramCache]: Analyzing trace with hash -1950399881, now seen corresponding path program 1 times
[2021-06-01 15:51:10,077 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:10,077 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014047835]
[2021-06-01 15:51:10,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:10,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:10,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:10,451 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:10,451 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014047835]
[2021-06-01 15:51:10,452 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014047835] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:10,452 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:10,452 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:51:10,453 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792820961]
[2021-06-01 15:51:10,456 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:51:10,456 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:10,480 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:51:10,480 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:51:10,487 INFO  L87              Difference]: Start difference. First operand  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,741 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:10,741 INFO  L93              Difference]: Finished difference Result 2370 states and 6279 transitions.
[2021-06-01 15:51:10,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 15:51:10,744 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2021-06-01 15:51:10,744 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:10,765 INFO  L225             Difference]: With dead ends: 2370
[2021-06-01 15:51:10,765 INFO  L226             Difference]: Without dead ends: 970
[2021-06-01 15:51:10,767 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 179.4ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2021-06-01 15:51:10,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 970 states.
[2021-06-01 15:51:10,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970.
[2021-06-01 15:51:10,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 970 states, 969 states have (on average 2.5541795665634677) internal successors, (2475), 969 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2475 transitions.
[2021-06-01 15:51:10,863 INFO  L78                 Accepts]: Start accepts. Automaton has 970 states and 2475 transitions. Word has length 60
[2021-06-01 15:51:10,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:10,864 INFO  L482      AbstractCegarLoop]: Abstraction has 970 states and 2475 transitions.
[2021-06-01 15:51:10,864 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:10,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 970 states and 2475 transitions.
[2021-06-01 15:51:10,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2021-06-01 15:51:10,867 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:10,867 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:10,867 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 15:51:10,867 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:10,868 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:10,868 INFO  L82        PathProgramCache]: Analyzing trace with hash 1346869176, now seen corresponding path program 1 times
[2021-06-01 15:51:10,868 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:10,869 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666431726]
[2021-06-01 15:51:10,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:10,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:11,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:11,008 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:11,008 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666431726]
[2021-06-01 15:51:11,008 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666431726] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:11,008 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:11,008 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:51:11,009 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273930465]
[2021-06-01 15:51:11,010 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:51:11,010 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:11,011 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:51:11,011 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:51:11,011 INFO  L87              Difference]: Start difference. First operand 970 states and 2475 transitions. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:11,166 INFO  L93              Difference]: Finished difference Result 1010 states and 2485 transitions.
[2021-06-01 15:51:11,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 15:51:11,167 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64
[2021-06-01 15:51:11,167 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:11,170 INFO  L225             Difference]: With dead ends: 1010
[2021-06-01 15:51:11,170 INFO  L226             Difference]: Without dead ends: 730
[2021-06-01 15:51:11,171 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 140.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:51:11,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 730 states.
[2021-06-01 15:51:11,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730.
[2021-06-01 15:51:11,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 730 states, 729 states have (on average 2.4074074074074074) internal successors, (1755), 729 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1755 transitions.
[2021-06-01 15:51:11,189 INFO  L78                 Accepts]: Start accepts. Automaton has 730 states and 1755 transitions. Word has length 64
[2021-06-01 15:51:11,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:11,190 INFO  L482      AbstractCegarLoop]: Abstraction has 730 states and 1755 transitions.
[2021-06-01 15:51:11,190 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 730 states and 1755 transitions.
[2021-06-01 15:51:11,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2021-06-01 15:51:11,191 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:11,192 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:11,192 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 15:51:11,192 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:11,192 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:11,193 INFO  L82        PathProgramCache]: Analyzing trace with hash -1159921082, now seen corresponding path program 1 times
[2021-06-01 15:51:11,193 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:11,193 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041862998]
[2021-06-01 15:51:11,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:11,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:11,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:11,425 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:11,425 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041862998]
[2021-06-01 15:51:11,425 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041862998] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:11,425 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:11,426 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:51:11,426 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460933147]
[2021-06-01 15:51:11,426 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:51:11,426 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:11,427 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:51:11,427 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:51:11,427 INFO  L87              Difference]: Start difference. First operand 730 states and 1755 transitions. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,560 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:11,560 INFO  L93              Difference]: Finished difference Result 574 states and 1318 transitions.
[2021-06-01 15:51:11,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-01 15:51:11,561 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2021-06-01 15:51:11,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:11,564 INFO  L225             Difference]: With dead ends: 574
[2021-06-01 15:51:11,564 INFO  L226             Difference]: Without dead ends: 406
[2021-06-01 15:51:11,565 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 119.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:51:11,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 406 states.
[2021-06-01 15:51:11,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406.
[2021-06-01 15:51:11,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 406 states, 405 states have (on average 2.2) internal successors, (891), 405 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 891 transitions.
[2021-06-01 15:51:11,575 INFO  L78                 Accepts]: Start accepts. Automaton has 406 states and 891 transitions. Word has length 67
[2021-06-01 15:51:11,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:11,576 INFO  L482      AbstractCegarLoop]: Abstraction has 406 states and 891 transitions.
[2021-06-01 15:51:11,576 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 406 states and 891 transitions.
[2021-06-01 15:51:11,578 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-06-01 15:51:11,578 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:11,578 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:11,579 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 15:51:11,579 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:11,582 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:11,582 INFO  L82        PathProgramCache]: Analyzing trace with hash -865779852, now seen corresponding path program 1 times
[2021-06-01 15:51:11,583 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:11,583 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998255732]
[2021-06-01 15:51:11,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:11,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:11,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:11,834 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:11,835 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998255732]
[2021-06-01 15:51:11,835 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998255732] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:11,835 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:11,835 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:51:11,836 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530134817]
[2021-06-01 15:51:11,836 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:51:11,836 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:11,837 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:51:11,837 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:51:11,837 INFO  L87              Difference]: Start difference. First operand 406 states and 891 transitions. Second operand  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:11,952 INFO  L93              Difference]: Finished difference Result 571 states and 1271 transitions.
[2021-06-01 15:51:11,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-06-01 15:51:11,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2021-06-01 15:51:11,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:11,957 INFO  L225             Difference]: With dead ends: 571
[2021-06-01 15:51:11,957 INFO  L226             Difference]: Without dead ends: 333
[2021-06-01 15:51:11,958 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:51:11,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 333 states.
[2021-06-01 15:51:11,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 318.
[2021-06-01 15:51:11,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 318 states, 317 states have (on average 2.1293375394321767) internal successors, (675), 317 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 675 transitions.
[2021-06-01 15:51:11,965 INFO  L78                 Accepts]: Start accepts. Automaton has 318 states and 675 transitions. Word has length 71
[2021-06-01 15:51:11,965 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:11,965 INFO  L482      AbstractCegarLoop]: Abstraction has 318 states and 675 transitions.
[2021-06-01 15:51:11,966 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:11,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 318 states and 675 transitions.
[2021-06-01 15:51:11,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-06-01 15:51:11,967 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:11,967 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:11,967 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 15:51:11,967 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:11,967 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:11,967 INFO  L82        PathProgramCache]: Analyzing trace with hash -1909370168, now seen corresponding path program 2 times
[2021-06-01 15:51:11,968 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:11,970 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195871879]
[2021-06-01 15:51:11,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:12,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:12,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:12,156 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:12,156 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195871879]
[2021-06-01 15:51:12,157 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195871879] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:12,157 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:12,158 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 15:51:12,158 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197305189]
[2021-06-01 15:51:12,159 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 15:51:12,160 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:12,160 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 15:51:12,161 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-06-01 15:51:12,161 INFO  L87              Difference]: Start difference. First operand 318 states and 675 transitions. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:12,254 INFO  L93              Difference]: Finished difference Result 483 states and 1055 transitions.
[2021-06-01 15:51:12,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-06-01 15:51:12,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2021-06-01 15:51:12,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:12,256 INFO  L225             Difference]: With dead ends: 483
[2021-06-01 15:51:12,257 INFO  L226             Difference]: Without dead ends: 296
[2021-06-01 15:51:12,257 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2021-06-01 15:51:12,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2021-06-01 15:51:12,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296.
[2021-06-01 15:51:12,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 296 states, 295 states have (on average 2.1050847457627118) internal successors, (621), 295 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 621 transitions.
[2021-06-01 15:51:12,263 INFO  L78                 Accepts]: Start accepts. Automaton has 296 states and 621 transitions. Word has length 71
[2021-06-01 15:51:12,264 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:12,264 INFO  L482      AbstractCegarLoop]: Abstraction has 296 states and 621 transitions.
[2021-06-01 15:51:12,264 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 296 states and 621 transitions.
[2021-06-01 15:51:12,265 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-06-01 15:51:12,265 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:12,265 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:12,265 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 15:51:12,266 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:12,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:12,267 INFO  L82        PathProgramCache]: Analyzing trace with hash 1598903850, now seen corresponding path program 3 times
[2021-06-01 15:51:12,267 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:12,268 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612645488]
[2021-06-01 15:51:12,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:12,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:12,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:12,494 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:12,498 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612645488]
[2021-06-01 15:51:12,498 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612645488] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:12,498 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:12,498 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 15:51:12,499 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771869114]
[2021-06-01 15:51:12,500 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 15:51:12,500 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:12,500 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 15:51:12,500 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-06-01 15:51:12,501 INFO  L87              Difference]: Start difference. First operand 296 states and 621 transitions. Second operand  has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:12,705 INFO  L93              Difference]: Finished difference Result 434 states and 935 transitions.
[2021-06-01 15:51:12,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 15:51:12,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2021-06-01 15:51:12,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:12,707 INFO  L225             Difference]: With dead ends: 434
[2021-06-01 15:51:12,707 INFO  L226             Difference]: Without dead ends: 260
[2021-06-01 15:51:12,708 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 190.4ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:51:12,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2021-06-01 15:51:12,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260.
[2021-06-01 15:51:12,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 259 states have (on average 2.027027027027027) internal successors, (525), 259 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 525 transitions.
[2021-06-01 15:51:12,713 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 525 transitions. Word has length 71
[2021-06-01 15:51:12,714 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:12,714 INFO  L482      AbstractCegarLoop]: Abstraction has 260 states and 525 transitions.
[2021-06-01 15:51:12,714 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,714 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 525 transitions.
[2021-06-01 15:51:12,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-06-01 15:51:12,715 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:12,715 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:12,715 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 15:51:12,715 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:12,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:12,716 INFO  L82        PathProgramCache]: Analyzing trace with hash -944669142, now seen corresponding path program 4 times
[2021-06-01 15:51:12,716 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:12,716 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352508201]
[2021-06-01 15:51:12,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:12,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:51:12,753 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:51:12,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:51:12,828 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:51:12,856 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 15:51:12,856 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 15:51:12,856 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 15:51:12,856 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3)
[2021-06-01 15:51:12,858 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:51:12,858 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:51:12,859 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 15:51:12,859 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:51:12,859 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:51:12,859 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:51:12,859 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 15:51:12,859 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:51:12,859 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork1========
[2021-06-01 15:51:12,861 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 90 transitions, 190 flow
[2021-06-01 15:51:12,896 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,900 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2021-06-01 15:51:12,901 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 15:51:12,901 INFO  L554         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:51:12,901 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:51:12,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:51:12,901 INFO  L82        PathProgramCache]: Analyzing trace with hash -1858689094, now seen corresponding path program 1 times
[2021-06-01 15:51:12,902 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:51:12,902 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784753077]
[2021-06-01 15:51:12,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:51:12,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:51:12,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:51:12,925 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:51:12,925 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784753077]
[2021-06-01 15:51:12,926 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784753077] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:51:12,926 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:51:12,926 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 15:51:12,926 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026502304]
[2021-06-01 15:51:12,926 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 15:51:12,926 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:51:12,927 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 15:51:12,927 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:51:12,930 INFO  L87              Difference]: Start difference. First operand  has 2013 states, 2009 states have (on average 2.753608760577402) internal successors, (5532), 2012 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:51:12,958 INFO  L93              Difference]: Finished difference Result 1768 states and 4692 transitions.
[2021-06-01 15:51:12,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-01 15:51:12,960 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48
[2021-06-01 15:51:12,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:51:12,961 INFO  L225             Difference]: With dead ends: 1768
[2021-06-01 15:51:12,961 INFO  L226             Difference]: Without dead ends: 0
[2021-06-01 15:51:12,961 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:51:12,961 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 15:51:12,961 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 15:51:12,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 15:51:12,962 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48
[2021-06-01 15:51:12,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:51:12,962 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 15:51:12,962 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:51:12,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 15:51:12,962 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:51:12,962 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 15:51:12,963 INFO  L301   ceAbstractionStarter]: Result for error location P1Thread1of1ForFork1 was SAFE (3/3)
[2021-06-01 15:51:12,963 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 15:51:13,104 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 03:51:13 BasicIcfg
[2021-06-01 15:51:13,105 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 15:51:13,107 INFO  L168              Benchmark]: Toolchain (without parser) took 5952.99 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 304.2 MB in the beginning and 324.2 MB in the end (delta: -20.0 MB). Peak memory consumption was 49.7 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,107 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 341.8 MB. Free memory is still 322.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,110 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 507.00 ms. Allocated memory is still 341.8 MB. Free memory was 304.1 MB in the beginning and 301.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,112 INFO  L168              Benchmark]: Boogie Procedure Inliner took 39.51 ms. Allocated memory is still 341.8 MB. Free memory was 301.6 MB in the beginning and 299.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,114 INFO  L168              Benchmark]: Boogie Preprocessor took 27.38 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 297.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,114 INFO  L168              Benchmark]: RCFGBuilder took 2011.90 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 291.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 154.7 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,114 INFO  L168              Benchmark]: TraceAbstraction took 3358.35 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 290.6 MB in the beginning and 324.2 MB in the end (delta: -33.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.0 GB.
[2021-06-01 15:51:13,115 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.18 ms. Allocated memory is still 341.8 MB. Free memory is still 322.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 507.00 ms. Allocated memory is still 341.8 MB. Free memory was 304.1 MB in the beginning and 301.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 39.51 ms. Allocated memory is still 341.8 MB. Free memory was 301.6 MB in the beginning and 299.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 27.38 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 297.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2011.90 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 291.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 154.7 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 3358.35 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 290.6 MB in the beginning and 324.2 MB in the end (delta: -33.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 19]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L713]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L715]               0  int __unbuffered_p1_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L716]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0]
[L717]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L719]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L720]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L721]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L722]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L723]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L724]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L725]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0]
[L726]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L727]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L728]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0]
[L729]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L730]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L731]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L732]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L733]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L735]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L737]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L738]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L739]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L813]               0  pthread_t t911;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L814]  FCALL, FORK  0  pthread_create(&t911, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L815]               0  pthread_t t912;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L816]  FCALL, FORK  0  pthread_create(&t912, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L771]               2  x$w_buff1 = x$w_buff0
[L772]               2  x$w_buff0 = 1
[L773]               2  x$w_buff1_used = x$w_buff0_used
[L774]               2  x$w_buff0_used = (_Bool)1
[L19]   COND FALSE   2  !(!expression)
[L776]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L777]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L778]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L779]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L782]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L785]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L788]               2  __unbuffered_p1_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L743]               1  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L746]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L747]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L748]               1  x$flush_delayed = weak$$choice2
[L749]               1  x$mem_tmp = x
[L750]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L750]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L751]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L751]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L751]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L751]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L752]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L752]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L752]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L753]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L753]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L753]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L754]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L754]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L754]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L755]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L755]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L755]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L756]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]               1  __unbuffered_p0_EAX = x
[L758]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L758]               1  x = x$flush_delayed ? x$mem_tmp : x
[L759]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L791]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L791]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L792]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L792]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L793]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L794]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L794]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L795]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L798]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L764]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L818]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L4]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L822]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L822]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L822]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L822]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L823]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L824]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L825]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L825]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L826]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L829]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L19]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L19]                0  reach_error()
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances
    CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 149.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 41.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 101.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2013occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
    CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2849.6ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 16.7ms, AutomataDifference: 1034.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 48.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 626 SDtfs, 820 SDslu, 2303 SDs, 0 SdLazy, 234 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 252.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 840.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2013occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 131.3ms AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 92.2ms SsaConstructionTime, 388.7ms SatisfiabilityAnalysisTime, 868.7ms InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork1 with 1 thread instances
    CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 104.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 4.2ms, AutomataDifference: 34.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 27 SDslu, 58 SDs, 0 SdLazy, 7 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2013occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3ms SsaConstructionTime, 3.8ms SatisfiabilityAnalysisTime, 15.2ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...