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


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


This is Ultimate 0.2.0-60729f1
[2020-11-11 23:27:26,872 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-11-11 23:27:26,875 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-11 23:27:26,914 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-11 23:27:26,915 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-11 23:27:26,917 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-11 23:27:26,919 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-11 23:27:26,921 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-11 23:27:26,924 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-11 23:27:26,925 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-11 23:27:26,926 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-11-11 23:27:26,928 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-11 23:27:26,929 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-11 23:27:26,930 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-11 23:27:26,932 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-11 23:27:26,933 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-11 23:27:26,935 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-11 23:27:26,936 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-11 23:27:26,938 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-11 23:27:26,941 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-11 23:27:26,944 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-11 23:27:26,946 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-11 23:27:26,947 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-11-11 23:27:26,948 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-11 23:27:26,952 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-11 23:27:26,952 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-11 23:27:26,952 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-11 23:27:26,954 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-11 23:27:26,954 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-11 23:27:26,955 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-11 23:27:26,956 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-11 23:27:26,962 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-11 23:27:26,963 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-11 23:27:26,964 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-11 23:27:26,965 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-11 23:27:26,966 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-11 23:27:26,970 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-11 23:27:26,970 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-11 23:27:26,971 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-11 23:27:26,972 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-11 23:27:26,973 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-11-11 23:27:26,976 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-SemanticLbe.epf
[2020-11-11 23:27:27,028 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-11-11 23:27:27,028 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-11 23:27:27,033 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-11-11 23:27:27,033 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-11-11 23:27:27,033 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-11-11 23:27:27,034 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-11 23:27:27,034 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-11-11 23:27:27,034 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-11-11 23:27:27,034 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-11-11 23:27:27,034 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-11-11 23:27:27,035 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-11-11 23:27:27,035 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-11 23:27:27,035 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-11-11 23:27:27,035 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-11-11 23:27:27,035 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-11-11 23:27:27,036 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-11-11 23:27:27,036 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-11-11 23:27:27,036 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-11 23:27:27,036 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-11-11 23:27:27,037 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-11-11 23:27:27,037 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-11-11 23:27:27,037 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-11 23:27:27,037 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-11 23:27:27,038 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-11-11 23:27:27,038 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-11-11 23:27:27,038 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-11-11 23:27:27,038 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-11-11 23:27:27,039 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-11 23:27:27,039 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
[2020-11-11 23:27:27,484 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-11 23:27:27,530 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-11 23:27:27,535 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-11 23:27:27,536 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-11-11 23:27:27,537 INFO  L275        PluginConnector]: CDTParser initialized
[2020-11-11 23:27:27,538 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i
[2020-11-11 23:27:27,646 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9923b3e4/ce7de250be2a4e248d437b07426d047b/FLAG9726b8119
[2020-11-11 23:27:28,413 INFO  L306              CDTParser]: Found 1 translation units.
[2020-11-11 23:27:28,413 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i
[2020-11-11 23:27:28,437 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9923b3e4/ce7de250be2a4e248d437b07426d047b/FLAG9726b8119
[2020-11-11 23:27:28,669 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9923b3e4/ce7de250be2a4e248d437b07426d047b
[2020-11-11 23:27:28,672 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-11 23:27:28,680 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-11-11 23:27:28,684 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-11 23:27:28,684 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-11 23:27:28,689 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-11 23:27:28,690 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:27:28" (1/1) ...
[2020-11-11 23:27:28,697 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307370b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:28, skipping insertion in model container
[2020-11-11 23:27:28,697 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:27:28" (1/1) ...
[2020-11-11 23:27:28,708 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-11-11 23:27:28,796 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-11-11 23:27:29,417 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-11 23:27:29,433 INFO  L203         MainTranslator]: Completed pre-run
[2020-11-11 23:27:29,515 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-11 23:27:29,653 INFO  L208         MainTranslator]: Completed translation
[2020-11-11 23:27:29,654 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29 WrapperNode
[2020-11-11 23:27:29,655 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-11 23:27:29,657 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-11-11 23:27:29,657 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-11-11 23:27:29,657 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-11-11 23:27:29,667 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,718 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,769 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-11-11 23:27:29,771 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-11 23:27:29,772 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-11 23:27:29,775 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-11-11 23:27:29,787 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,788 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,808 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,808 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,835 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,840 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,849 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (1/1) ...
[2020-11-11 23:27:29,860 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-11 23:27:29,862 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-11 23:27:29,862 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-11-11 23:27:29,862 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-11-11 23:27:29,863 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (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
[2020-11-11 23:27:29,948 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-11-11 23:27:29,948 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-11-11 23:27:29,948 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-11 23:27:29,949 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-11 23:27:29,949 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-11-11 23:27:29,949 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-11-11 23:27:29,949 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-11-11 23:27:29,950 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-11-11 23:27:29,950 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-11-11 23:27:29,950 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-11-11 23:27:29,950 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-11 23:27:29,950 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-11-11 23:27:29,951 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-11 23:27:29,951 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-11 23:27:29,953 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-11-11 23:27:32,454 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-11 23:27:32,454 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-11-11 23:27:32,457 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:27:32 BoogieIcfgContainer
[2020-11-11 23:27:32,457 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-11 23:27:32,459 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-11 23:27:32,459 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-11-11 23:27:32,463 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-11-11 23:27:32,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:27:28" (1/3) ...
[2020-11-11 23:27:32,464 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:27:32, skipping insertion in model container
[2020-11-11 23:27:32,464 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:27:29" (2/3) ...
[2020-11-11 23:27:32,465 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e08c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:27:32, skipping insertion in model container
[2020-11-11 23:27:32,465 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:27:32" (3/3) ...
[2020-11-11 23:27:32,466 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix056_rmo.oepc.i
[2020-11-11 23:27:32,484 WARN  L168   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-11-11 23:27:32,484 INFO  L179   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-11-11 23:27:32,488 INFO  L191   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-11-11 23:27:32,489 INFO  L351   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-11-11 23:27:32,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,532 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,532 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,534 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,535 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,538 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,539 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,540 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,541 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,541 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,542 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,543 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,544 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,544 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,544 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,544 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,545 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,545 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,545 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,546 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,546 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,547 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,562 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,564 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,564 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,564 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,564 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,564 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,565 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,565 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,565 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,565 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,566 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,566 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,566 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,566 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,566 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,567 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,567 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,567 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,567 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,570 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,572 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,572 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,576 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,577 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,577 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,578 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,580 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,581 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,582 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,583 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,584 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,585 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,585 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,585 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,585 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,585 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-11 23:27:32,587 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-11-11 23:27:32,600 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-11-11 23:27:32,626 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-11-11 23:27:32,626 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-11-11 23:27:32,626 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-11-11 23:27:32,626 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-11-11 23:27:32,626 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-11 23:27:32,626 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-11-11 23:27:32,626 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-11 23:27:32,627 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-11 23:27:32,640 INFO  L120   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-11-11 23:27:32,643 INFO  L135   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow
[2020-11-11 23:27:32,646 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow
[2020-11-11 23:27:32,648 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow
[2020-11-11 23:27:32,697 INFO  L129       PetriNetUnfolder]: 3/98 cut-off events.
[2020-11-11 23:27:32,697 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-11-11 23:27:32,701 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. 
[2020-11-11 23:27:32,705 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1870
[2020-11-11 23:27:32,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:32,819 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:32,821 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:32,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:32,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:32,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:32,831 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:32,831 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:32,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:32,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:32,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:32,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:32,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:32,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:32,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:32,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:33,785 WARN  L193               SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47
[2020-11-11 23:27:33,922 WARN  L193               SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59
[2020-11-11 23:27:34,094 WARN  L193               SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50
[2020-11-11 23:27:34,457 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,467 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:34,469 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:34,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:34,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:34,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:34,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:34,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,482 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:34,602 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:34,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-11 23:27:34,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:34,608 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:34,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,648 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,649 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,655 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,674 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,676 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,769 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,773 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,793 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:34,796 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:34,796 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:34,799 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:34,799 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,302 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,303 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,304 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,306 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,332 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,336 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,336 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,338 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,430 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,443 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,445 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,445 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,447 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:35,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,497 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-11 23:27:35,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:35,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,543 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,544 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,545 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,547 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,550 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,568 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,570 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,572 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,573 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,575 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:35,575 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:35,630 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,630 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-11 23:27:35,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:35,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:35,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:35,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,682 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-11 23:27:35,686 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-11 23:27:35,686 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:35,689 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-11 23:27:35,689 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-11 23:27:36,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,156 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,157 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,160 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,160 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,178 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,179 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,180 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,242 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-11 23:27:36,243 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,424 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,425 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,426 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,429 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,429 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,431 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-11 23:27:36,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-11 23:27:36,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:36,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-11 23:27:36,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-11 23:27:38,140 WARN  L193               SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67
[2020-11-11 23:27:38,507 WARN  L193               SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58
[2020-11-11 23:27:38,733 WARN  L193               SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58
[2020-11-11 23:27:39,287 WARN  L193               SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112
[2020-11-11 23:27:39,540 WARN  L193               SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-11 23:27:40,049 WARN  L193               SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112
[2020-11-11 23:27:40,275 WARN  L193               SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-11 23:27:40,298 INFO  L131        LiptonReduction]: Checked pairs total: 4799
[2020-11-11 23:27:40,298 INFO  L133        LiptonReduction]: Total number of compositions: 88
[2020-11-11 23:27:40,305 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-11-11 23:27:40,375 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 974 states, 970 states have (on average 3.37319587628866) internal successors, (3272), 973 states have internal predecessors, (3272), 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)
[2020-11-11 23:27:40,382 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 974 states, 970 states have (on average 3.37319587628866) internal successors, (3272), 973 states have internal predecessors, (3272), 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)
[2020-11-11 23:27:40,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-11-11 23:27:40,388 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:40,389 INFO  L494         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-11-11 23:27:40,391 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:40,403 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:40,403 INFO  L82        PathProgramCache]: Analyzing trace with hash 1089408, now seen corresponding path program 1 times
[2020-11-11 23:27:40,411 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:40,412 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518765328]
[2020-11-11 23:27:40,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:40,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:40,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:40,652 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518765328]
[2020-11-11 23:27:40,655 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:40,655 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-11-11 23:27:40,656 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838474656]
[2020-11-11 23:27:40,661 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-11 23:27:40,661 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:40,681 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-11 23:27:40,681 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-11 23:27:40,687 INFO  L87              Difference]: Start difference. First operand  has 974 states, 970 states have (on average 3.37319587628866) internal successors, (3272), 973 states have internal predecessors, (3272), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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)
[2020-11-11 23:27:40,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:40,839 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-11-11 23:27:40,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-11 23:27:40,843 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3
[2020-11-11 23:27:40,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:40,871 INFO  L225             Difference]: With dead ends: 812
[2020-11-11 23:27:40,871 INFO  L226             Difference]: Without dead ends: 687
[2020-11-11 23:27:40,872 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-11 23:27:40,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2020-11-11 23:27:40,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2020-11-11 23:27:40,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 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)
[2020-11-11 23:27:40,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions.
[2020-11-11 23:27:40,992 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3
[2020-11-11 23:27:40,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:40,992 INFO  L481      AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions.
[2020-11-11 23:27:40,993 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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)
[2020-11-11 23:27:40,993 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions.
[2020-11-11 23:27:40,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-11-11 23:27:40,999 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:40,999 INFO  L494         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:27:40,999 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-11 23:27:40,999 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,000 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,000 INFO  L82        PathProgramCache]: Analyzing trace with hash 1379295438, now seen corresponding path program 1 times
[2020-11-11 23:27:41,000 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,001 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999455540]
[2020-11-11 23:27:41,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:41,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:41,107 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999455540]
[2020-11-11 23:27:41,107 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:41,108 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-11 23:27:41,108 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640267566]
[2020-11-11 23:27:41,109 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-11 23:27:41,109 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:41,110 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-11 23:27:41,110 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-11 23:27:41,110 INFO  L87              Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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)
[2020-11-11 23:27:41,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:41,125 INFO  L93              Difference]: Finished difference Result 431 states and 1126 transitions.
[2020-11-11 23:27:41,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-11 23:27:41,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10
[2020-11-11 23:27:41,126 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:41,130 INFO  L225             Difference]: With dead ends: 431
[2020-11-11 23:27:41,130 INFO  L226             Difference]: Without dead ends: 431
[2020-11-11 23:27:41,131 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-11 23:27:41,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2020-11-11 23:27:41,147 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431.
[2020-11-11 23:27:41,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 431 states, 430 states have (on average 2.6186046511627907) internal successors, (1126), 430 states have internal predecessors, (1126), 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)
[2020-11-11 23:27:41,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1126 transitions.
[2020-11-11 23:27:41,152 INFO  L78                 Accepts]: Start accepts. Automaton has 431 states and 1126 transitions. Word has length 10
[2020-11-11 23:27:41,152 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:41,152 INFO  L481      AbstractCegarLoop]: Abstraction has 431 states and 1126 transitions.
[2020-11-11 23:27:41,152 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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)
[2020-11-11 23:27:41,152 INFO  L276                IsEmpty]: Start isEmpty. Operand 431 states and 1126 transitions.
[2020-11-11 23:27:41,155 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-11-11 23:27:41,155 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:41,155 INFO  L494         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:27:41,155 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-11 23:27:41,156 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,156 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,156 INFO  L82        PathProgramCache]: Analyzing trace with hash -1255951480, now seen corresponding path program 1 times
[2020-11-11 23:27:41,156 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,157 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567880616]
[2020-11-11 23:27:41,157 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:41,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:41,290 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567880616]
[2020-11-11 23:27:41,290 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:41,290 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-11 23:27:41,291 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787157223]
[2020-11-11 23:27:41,291 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:27:41,291 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:41,292 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:27:41,296 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:27:41,296 INFO  L87              Difference]: Start difference. First operand 431 states and 1126 transitions. Second operand  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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)
[2020-11-11 23:27:41,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:41,327 INFO  L93              Difference]: Finished difference Result 239 states and 550 transitions.
[2020-11-11 23:27:41,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-11-11 23:27:41,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14
[2020-11-11 23:27:41,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:41,329 INFO  L225             Difference]: With dead ends: 239
[2020-11-11 23:27:41,329 INFO  L226             Difference]: Without dead ends: 239
[2020-11-11 23:27:41,330 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:27:41,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2020-11-11 23:27:41,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239.
[2020-11-11 23:27:41,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 239 states, 238 states have (on average 2.310924369747899) internal successors, (550), 238 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-11 23:27:41,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 550 transitions.
[2020-11-11 23:27:41,340 INFO  L78                 Accepts]: Start accepts. Automaton has 239 states and 550 transitions. Word has length 14
[2020-11-11 23:27:41,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:41,341 INFO  L481      AbstractCegarLoop]: Abstraction has 239 states and 550 transitions.
[2020-11-11 23:27:41,341 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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)
[2020-11-11 23:27:41,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 239 states and 550 transitions.
[2020-11-11 23:27:41,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-11-11 23:27:41,343 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:41,344 INFO  L494         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-11 23:27:41,344 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-11 23:27:41,344 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,344 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,345 INFO  L82        PathProgramCache]: Analyzing trace with hash 2027596681, now seen corresponding path program 1 times
[2020-11-11 23:27:41,345 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,345 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608145887]
[2020-11-11 23:27:41,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:41,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:41,445 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608145887]
[2020-11-11 23:27:41,445 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:41,445 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-11 23:27:41,445 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690990467]
[2020-11-11 23:27:41,446 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-11-11 23:27:41,446 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:41,446 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-11-11 23:27:41,447 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:27:41,447 INFO  L87              Difference]: Start difference. First operand 239 states and 550 transitions. Second operand  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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)
[2020-11-11 23:27:41,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:41,476 INFO  L93              Difference]: Finished difference Result 191 states and 454 transitions.
[2020-11-11 23:27:41,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-11-11 23:27:41,477 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18
[2020-11-11 23:27:41,477 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:41,478 INFO  L225             Difference]: With dead ends: 191
[2020-11-11 23:27:41,479 INFO  L226             Difference]: Without dead ends: 191
[2020-11-11 23:27:41,479 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:27:41,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2020-11-11 23:27:41,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191.
[2020-11-11 23:27:41,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 190 states have (on average 2.389473684210526) internal successors, (454), 190 states have internal predecessors, (454), 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)
[2020-11-11 23:27:41,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 454 transitions.
[2020-11-11 23:27:41,486 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 454 transitions. Word has length 18
[2020-11-11 23:27:41,486 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:41,486 INFO  L481      AbstractCegarLoop]: Abstraction has 191 states and 454 transitions.
[2020-11-11 23:27:41,486 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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)
[2020-11-11 23:27:41,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 454 transitions.
[2020-11-11 23:27:41,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-11-11 23:27:41,489 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:41,489 INFO  L494         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]
[2020-11-11 23:27:41,489 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-11 23:27:41,489 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,490 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,490 INFO  L82        PathProgramCache]: Analyzing trace with hash -123290463, now seen corresponding path program 1 times
[2020-11-11 23:27:41,490 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,490 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564224863]
[2020-11-11 23:27:41,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:41,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:41,667 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564224863]
[2020-11-11 23:27:41,668 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:41,668 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-11 23:27:41,668 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421648209]
[2020-11-11 23:27:41,668 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:27:41,669 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:41,669 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:27:41,669 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:27:41,669 INFO  L87              Difference]: Start difference. First operand 191 states and 454 transitions. Second operand  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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)
[2020-11-11 23:27:41,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:41,696 INFO  L93              Difference]: Finished difference Result 254 states and 590 transitions.
[2020-11-11 23:27:41,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-11-11 23:27:41,697 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22
[2020-11-11 23:27:41,697 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:41,698 INFO  L225             Difference]: With dead ends: 254
[2020-11-11 23:27:41,699 INFO  L226             Difference]: Without dead ends: 151
[2020-11-11 23:27:41,699 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:27:41,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2020-11-11 23:27:41,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151.
[2020-11-11 23:27:41,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 151 states, 150 states have (on average 2.28) internal successors, (342), 150 states have internal predecessors, (342), 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)
[2020-11-11 23:27:41,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 342 transitions.
[2020-11-11 23:27:41,705 INFO  L78                 Accepts]: Start accepts. Automaton has 151 states and 342 transitions. Word has length 22
[2020-11-11 23:27:41,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:41,705 INFO  L481      AbstractCegarLoop]: Abstraction has 151 states and 342 transitions.
[2020-11-11 23:27:41,705 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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)
[2020-11-11 23:27:41,706 INFO  L276                IsEmpty]: Start isEmpty. Operand 151 states and 342 transitions.
[2020-11-11 23:27:41,706 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-11-11 23:27:41,707 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:41,707 INFO  L494         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]
[2020-11-11 23:27:41,707 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-11 23:27:41,707 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,707 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,707 INFO  L82        PathProgramCache]: Analyzing trace with hash 866689195, now seen corresponding path program 2 times
[2020-11-11 23:27:41,708 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,708 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831118338]
[2020-11-11 23:27:41,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:41,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:41,799 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831118338]
[2020-11-11 23:27:41,799 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:41,799 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-11 23:27:41,799 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280685129]
[2020-11-11 23:27:41,800 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-11 23:27:41,800 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:41,800 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-11 23:27:41,801 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-11 23:27:41,801 INFO  L87              Difference]: Start difference. First operand 151 states and 342 transitions. Second operand  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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)
[2020-11-11 23:27:41,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:41,822 INFO  L93              Difference]: Finished difference Result 226 states and 504 transitions.
[2020-11-11 23:27:41,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-11-11 23:27:41,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22
[2020-11-11 23:27:41,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:41,824 INFO  L225             Difference]: With dead ends: 226
[2020-11-11 23:27:41,824 INFO  L226             Difference]: Without dead ends: 103
[2020-11-11 23:27:41,824 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-11-11 23:27:41,825 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2020-11-11 23:27:41,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2020-11-11 23:27:41,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 102 states have (on average 2.0980392156862746) internal successors, (214), 102 states have internal predecessors, (214), 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)
[2020-11-11 23:27:41,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions.
[2020-11-11 23:27:41,829 INFO  L78                 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 22
[2020-11-11 23:27:41,829 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:41,829 INFO  L481      AbstractCegarLoop]: Abstraction has 103 states and 214 transitions.
[2020-11-11 23:27:41,829 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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)
[2020-11-11 23:27:41,829 INFO  L276                IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions.
[2020-11-11 23:27:41,830 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-11-11 23:27:41,830 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:41,830 INFO  L494         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]
[2020-11-11 23:27:41,830 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-11 23:27:41,830 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:41,831 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:41,831 INFO  L82        PathProgramCache]: Analyzing trace with hash 1723449925, now seen corresponding path program 3 times
[2020-11-11 23:27:41,831 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:41,831 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114239427]
[2020-11-11 23:27:41,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:41,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-11 23:27:42,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-11 23:27:42,123 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114239427]
[2020-11-11 23:27:42,124 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-11 23:27:42,124 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-11 23:27:42,124 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760974440]
[2020-11-11 23:27:42,124 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-11 23:27:42,125 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-11 23:27:42,126 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-11 23:27:42,126 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-11-11 23:27:42,126 INFO  L87              Difference]: Start difference. First operand 103 states and 214 transitions. Second operand  has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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)
[2020-11-11 23:27:42,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-11 23:27:42,329 INFO  L93              Difference]: Finished difference Result 124 states and 250 transitions.
[2020-11-11 23:27:42,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-11-11 23:27:42,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 22
[2020-11-11 23:27:42,330 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-11 23:27:42,332 INFO  L225             Difference]: With dead ends: 124
[2020-11-11 23:27:42,332 INFO  L226             Difference]: Without dead ends: 63
[2020-11-11 23:27:42,332 INFO  L749         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-11-11 23:27:42,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-11-11 23:27:42,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-11-11 23:27:42,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 62 states have internal predecessors, (110), 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)
[2020-11-11 23:27:42,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions.
[2020-11-11 23:27:42,336 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22
[2020-11-11 23:27:42,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-11 23:27:42,336 INFO  L481      AbstractCegarLoop]: Abstraction has 63 states and 110 transitions.
[2020-11-11 23:27:42,336 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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)
[2020-11-11 23:27:42,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions.
[2020-11-11 23:27:42,337 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-11-11 23:27:42,337 INFO  L486         BasicCegarLoop]: Found error trace
[2020-11-11 23:27:42,337 INFO  L494         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]
[2020-11-11 23:27:42,337 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-11 23:27:42,337 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-11 23:27:42,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-11 23:27:42,338 INFO  L82        PathProgramCache]: Analyzing trace with hash -2459643, now seen corresponding path program 4 times
[2020-11-11 23:27:42,338 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-11 23:27:42,338 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215342895]
[2020-11-11 23:27:42,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-11 23:27:42,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-11 23:27:42,497 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-11 23:27:42,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-11 23:27:42,620 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-11 23:27:42,695 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-11-11 23:27:42,695 INFO  L595         BasicCegarLoop]: Counterexample might be feasible
[2020-11-11 23:27:42,696 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-11 23:27:42,884 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:27:42 BasicIcfg
[2020-11-11 23:27:42,884 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-11 23:27:42,886 INFO  L168              Benchmark]: Toolchain (without parser) took 14212.09 ms. Allocated memory was 302.0 MB in the beginning and 513.8 MB in the end (delta: 211.8 MB). Free memory was 276.2 MB in the beginning and 482.8 MB in the end (delta: -206.6 MB). Peak memory consumption was 300.1 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,887 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,888 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 971.17 ms. Allocated memory is still 302.0 MB. Free memory was 275.6 MB in the beginning and 271.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,889 INFO  L168              Benchmark]: Boogie Procedure Inliner took 113.80 ms. Allocated memory is still 302.0 MB. Free memory was 271.2 MB in the beginning and 269.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,890 INFO  L168              Benchmark]: Boogie Preprocessor took 89.27 ms. Allocated memory is still 302.0 MB. Free memory was 269.2 MB in the beginning and 267.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,891 INFO  L168              Benchmark]: RCFGBuilder took 2595.68 ms. Allocated memory was 302.0 MB in the beginning and 381.7 MB in the end (delta: 79.7 MB). Free memory was 267.1 MB in the beginning and 349.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,897 INFO  L168              Benchmark]: TraceAbstraction took 10425.73 ms. Allocated memory was 381.7 MB in the beginning and 513.8 MB in the end (delta: 132.1 MB). Free memory was 349.7 MB in the beginning and 482.8 MB in the end (delta: -133.2 MB). Peak memory consumption was 291.5 MB. Max. memory is 16.0 GB.
[2020-11-11 23:27:42,902 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 302.0 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 971.17 ms. Allocated memory is still 302.0 MB. Free memory was 275.6 MB in the beginning and 271.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 113.80 ms. Allocated memory is still 302.0 MB. Free memory was 271.2 MB in the beginning and 269.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 89.27 ms. Allocated memory is still 302.0 MB. Free memory was 269.2 MB in the beginning and 267.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2595.68 ms. Allocated memory was 302.0 MB in the beginning and 381.7 MB in the end (delta: 79.7 MB). Free memory was 267.1 MB in the beginning and 349.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 10425.73 ms. Allocated memory was 381.7 MB in the beginning and 513.8 MB in the end (delta: 132.1 MB). Free memory was 349.7 MB in the beginning and 482.8 MB in the end (delta: -133.2 MB). Peak memory consumption was 291.5 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1318 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 189 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.6s, 108 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 4799 MoverChecksTotal
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L712]               0  _Bool main$tmp_guard0;
[L713]               0  _Bool main$tmp_guard1;
[L715]               0  int x = 0;
[L717]               0  int y = 0;
[L719]               0  int z = 0;
[L720]               0  _Bool z$flush_delayed;
[L721]               0  int z$mem_tmp;
[L722]               0  _Bool z$r_buff0_thd0;
[L723]               0  _Bool z$r_buff0_thd1;
[L724]               0  _Bool z$r_buff0_thd2;
[L725]               0  _Bool z$r_buff0_thd3;
[L726]               0  _Bool z$r_buff1_thd0;
[L727]               0  _Bool z$r_buff1_thd1;
[L728]               0  _Bool z$r_buff1_thd2;
[L729]               0  _Bool z$r_buff1_thd3;
[L730]               0  _Bool z$read_delayed;
[L731]               0  int *z$read_delayed_var;
[L732]               0  int z$w_buff0;
[L733]               0  _Bool z$w_buff0_used;
[L734]               0  int z$w_buff1;
[L735]               0  _Bool z$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t1501;
[L832]  FCALL, FORK  0  pthread_create(&t1501, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L741]               1  z$w_buff1 = z$w_buff0
[L742]               1  z$w_buff0 = 1
[L743]               1  z$w_buff1_used = z$w_buff0_used
[L744]               1  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L746]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L747]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L748]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L749]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L750]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L833]               0  pthread_t t1502;
[L834]  FCALL, FORK  0  pthread_create(&t1502, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L835]               0  pthread_t t1503;
[L836]  FCALL, FORK  0  pthread_create(&t1503, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L770]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L790]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L777]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L777]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L778]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L778]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L779]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L779]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L780]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L780]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L785]               2  return 0;
[L793]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L794]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L795]               3  z$flush_delayed = weak$$choice2
[L796]               3  z$mem_tmp = z
[L797]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L797]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L798]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L798]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L799]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L799]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L800]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L800]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L801]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L802]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L802]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L803]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L804]               3  __unbuffered_p2_EAX = z
[L805]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L805]               3  z = z$flush_delayed ? z$mem_tmp : z
[L806]               3  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L756]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L757]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L758]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L758]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L759]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L759]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L760]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L760]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L765]               1  return 0;
[L809]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L809]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L809]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L809]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L810]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L810]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L811]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L811]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L812]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L812]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L813]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L813]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L816]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L818]               3  return 0;
[L838]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L842]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L842]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L842]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L842]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L843]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L843]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L844]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L844]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L845]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L845]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L846]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L849]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0)
[L18]   COND TRUE    0  !expression
[L17]   COND FALSE   0  !(0)
[L17]                0  __assert_fail ("0", "mix056_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 170 SDtfs, 126 SDslu, 332 SDs, 0 SdLazy, 121 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 8388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...