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


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


This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b
[2021-06-05 19:55:55,479 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-05 19:55:55,481 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-05 19:55:55,512 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-05 19:55:55,512 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-05 19:55:55,515 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-05 19:55:55,517 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-05 19:55:55,521 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-05 19:55:55,523 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-05 19:55:55,526 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-05 19:55:55,527 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-05 19:55:55,528 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-05 19:55:55,528 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-05 19:55:55,529 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-05 19:55:55,530 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-05 19:55:55,531 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-05 19:55:55,533 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-05 19:55:55,534 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-05 19:55:55,536 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-05 19:55:55,540 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-05 19:55:55,541 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-05 19:55:55,542 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-05 19:55:55,542 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-05 19:55:55,544 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-05 19:55:55,549 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-05 19:55:55,549 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-05 19:55:55,549 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-05 19:55:55,550 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-05 19:55:55,551 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-05 19:55:55,551 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-05 19:55:55,551 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-05 19:55:55,552 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-05 19:55:55,553 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-05 19:55:55,553 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-05 19:55:55,554 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-05 19:55:55,554 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-05 19:55:55,554 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-05 19:55:55,555 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-05 19:55:55,555 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-05 19:55:55,555 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-05 19:55:55,556 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-05 19:55:55,556 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-05 19:55:55,584 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-05 19:55:55,584 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-05 19:55:55,584 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-05 19:55:55,585 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-05 19:55:55,586 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-05 19:55:55,587 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-05 19:55:55,587 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-05 19:55:55,587 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-05 19:55:55,587 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-05 19:55:55,587 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-05 19:55:55,588 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-05 19:55:55,589 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-05 19:55:55,589 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-05 19:55:55,589 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-05 19:55:55,590 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-05 19:55:55,590 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-05 19:55:55,590 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-05 19:55:55,590 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-05 19:55:55,590 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-05 19:55:55,837 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-05 19:55:55,853 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-05 19:55:55,855 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-05 19:55:55,855 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-05 19:55:55,856 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-05 19:55:55,856 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i
[2021-06-05 19:55:55,917 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64458c2dc/26bb6bea55eb4c17b1157f6ef225c01b/FLAG297a09000
[2021-06-05 19:55:56,307 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-05 19:55:56,308 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i
[2021-06-05 19:55:56,329 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64458c2dc/26bb6bea55eb4c17b1157f6ef225c01b/FLAG297a09000
[2021-06-05 19:55:56,340 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64458c2dc/26bb6bea55eb4c17b1157f6ef225c01b
[2021-06-05 19:55:56,342 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-05 19:55:56,343 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-05 19:55:56,344 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:56,344 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-05 19:55:56,354 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-05 19:55:56,354 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,355 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24478bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56, skipping insertion in model container
[2021-06-05 19:55:56,355 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,361 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-05 19:55:56,405 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-05 19:55:56,517 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006]
[2021-06-05 19:55:56,624 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:56,629 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-05 19:55:56,636 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006]
[2021-06-05 19:55:56,672 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:56,718 INFO  L208         MainTranslator]: Completed translation
[2021-06-05 19:55:56,718 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56 WrapperNode
[2021-06-05 19:55:56,718 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:56,719 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:56,719 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-05 19:55:56,719 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-05 19:55:56,724 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,737 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,761 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:56,762 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-05 19:55:56,762 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-05 19:55:56,762 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-05 19:55:56,768 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,769 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,783 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,783 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,800 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,804 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,806 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,809 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-05 19:55:56,810 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-05 19:55:56,810 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-05 19:55:56,810 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-05 19:55:56,811 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-05 19:55:56,883 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-05 19:55:56,883 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-05 19:55:56,883 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-05 19:55:56,883 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-05 19:55:56,883 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-05 19:55:56,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-05 19:55:56,884 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-05 19:55:56,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-05 19:55:56,884 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-05 19:55:56,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-05 19:55:56,884 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-05 19:55:56,884 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-05 19:55:56,884 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-05 19:55:56,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-05 19:55:56,886 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-05 19:55:59,188 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-05 19:55:59,189 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-05 19:55:59,191 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:59 BoogieIcfgContainer
[2021-06-05 19:55:59,191 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-05 19:55:59,192 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-05 19:55:59,192 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-05 19:55:59,194 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-05 19:55:59,194 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:55:56" (1/3) ...
[2021-06-05 19:55:59,194 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:59, skipping insertion in model container
[2021-06-05 19:55:59,195 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (2/3) ...
[2021-06-05 19:55:59,195 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:59, skipping insertion in model container
[2021-06-05 19:55:59,195 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:59" (3/3) ...
[2021-06-05 19:55:59,196 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i
[2021-06-05 19:55:59,201 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-05 19:55:59,201 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-05 19:55:59,201 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-05 19:55:59,202 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-05 19:55:59,237 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,238 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,250 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,251 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,253 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,253 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,253 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,272 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,277 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,289 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,290 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,293 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-05 19:55:59,308 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:55:59,322 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:55:59,323 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:55:59,323 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:55:59,323 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:55:59,323 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:55:59,323 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:55:59,323 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:55:59,323 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-05 19:55:59,330 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:00,148 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,193 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,267 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:56:00,268 INFO  L301   ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-05 19:56:00,269 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:56:00,270 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:56:00,270 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:56:00,270 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:56:00,270 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:56:00,270 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:56:00,270 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:56:00,270 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:56:00,270 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2========
[2021-06-05 19:56:00,272 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:01,070 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,104 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,105 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2021-06-05 19:56:01,105 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:01,106 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:01,106 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:01,109 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:01,109 INFO  L82        PathProgramCache]: Analyzing trace with hash -865950546, now seen corresponding path program 1 times
[2021-06-05 19:56:01,115 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:01,115 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650179036]
[2021-06-05 19:56:01,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:01,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:01,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:01,271 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:01,271 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650179036]
[2021-06-05 19:56:01,271 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650179036] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:01,271 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:01,271 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-05 19:56:01,272 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134946867]
[2021-06-05 19:56:01,274 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-05 19:56:01,274 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:01,281 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-05 19:56:01,282 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:01,314 INFO  L87              Difference]: Start difference. First operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:01,650 INFO  L93              Difference]: Finished difference Result 15583 states and 55472 transitions.
[2021-06-05 19:56:01,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-05 19:56:01,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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 49
[2021-06-05 19:56:01,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:01,655 INFO  L225             Difference]: With dead ends: 15583
[2021-06-05 19:56:01,656 INFO  L226             Difference]: Without dead ends: 0
[2021-06-05 19:56:01,656 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:01,667 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-05 19:56:01,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-05 19:56:01,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-05 19:56:01,671 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49
[2021-06-05 19:56:01,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:01,671 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-05 19:56:01,671 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-05 19:56:01,671 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:56:01,672 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-05 19:56:01,672 INFO  L301   ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3)
[2021-06-05 19:56:01,672 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-06-05 19:56:01,673 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:56:01,673 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:56:01,673 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:56:01,673 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:56:01,673 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:56:01,673 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:56:01,674 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:56:01,674 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-05 19:56:01,675 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:02,315 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,334 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-06-05 19:56:02,345 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:02,345 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:02,345 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:02,346 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:02,346 INFO  L82        PathProgramCache]: Analyzing trace with hash -64619290, now seen corresponding path program 1 times
[2021-06-05 19:56:02,346 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:02,346 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188659675]
[2021-06-05 19:56:02,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:02,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:02,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:02,480 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:02,480 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188659675]
[2021-06-05 19:56:02,480 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188659675] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:02,480 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:02,480 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:02,480 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731984583]
[2021-06-05 19:56:02,481 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:02,481 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:02,481 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:02,481 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:02,501 INFO  L87              Difference]: Start difference. First operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 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 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:02,768 INFO  L93              Difference]: Finished difference Result 21982 states and 78062 transitions.
[2021-06-05 19:56:02,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:02,769 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68
[2021-06-05 19:56:02,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:02,830 INFO  L225             Difference]: With dead ends: 21982
[2021-06-05 19:56:02,830 INFO  L226             Difference]: Without dead ends: 8662
[2021-06-05 19:56:02,830 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 66.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:02,939 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8662 states.
[2021-06-05 19:56:03,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8662 to 8662.
[2021-06-05 19:56:03,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8662 states, 8660 states have (on average 3.4742494226327945) internal successors, (30087), 8661 states have internal predecessors, (30087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:03,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 30087 transitions.
[2021-06-05 19:56:03,254 INFO  L78                 Accepts]: Start accepts. Automaton has 8662 states and 30087 transitions. Word has length 68
[2021-06-05 19:56:03,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:03,255 INFO  L482      AbstractCegarLoop]: Abstraction has 8662 states and 30087 transitions.
[2021-06-05 19:56:03,255 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:03,256 INFO  L276                IsEmpty]: Start isEmpty. Operand 8662 states and 30087 transitions.
[2021-06-05 19:56:03,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2021-06-05 19:56:03,268 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:03,268 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:03,268 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-05 19:56:03,268 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:03,269 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:03,269 INFO  L82        PathProgramCache]: Analyzing trace with hash 103649628, now seen corresponding path program 1 times
[2021-06-05 19:56:03,269 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:03,269 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640735773]
[2021-06-05 19:56:03,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:03,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:03,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:03,532 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:03,532 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640735773]
[2021-06-05 19:56:03,532 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640735773] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:03,532 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:03,532 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:03,533 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794270140]
[2021-06-05 19:56:03,534 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:03,534 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:03,534 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:03,535 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:03,535 INFO  L87              Difference]: Start difference. First operand 8662 states and 30087 transitions. Second operand  has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:04,254 INFO  L93              Difference]: Finished difference Result 9835 states and 33923 transitions.
[2021-06-05 19:56:04,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2021-06-05 19:56:04,255 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 72
[2021-06-05 19:56:04,256 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:04,303 INFO  L225             Difference]: With dead ends: 9835
[2021-06-05 19:56:04,303 INFO  L226             Difference]: Without dead ends: 8275
[2021-06-05 19:56:04,304 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 412.6ms TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756
[2021-06-05 19:56:04,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8275 states.
[2021-06-05 19:56:04,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8275 to 7897.
[2021-06-05 19:56:04,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7897 states, 7895 states have (on average 3.4580113996200126) internal successors, (27301), 7896 states have internal predecessors, (27301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 27301 transitions.
[2021-06-05 19:56:04,540 INFO  L78                 Accepts]: Start accepts. Automaton has 7897 states and 27301 transitions. Word has length 72
[2021-06-05 19:56:04,541 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:04,541 INFO  L482      AbstractCegarLoop]: Abstraction has 7897 states and 27301 transitions.
[2021-06-05 19:56:04,541 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 7897 states and 27301 transitions.
[2021-06-05 19:56:04,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-05 19:56:04,554 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:04,554 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:04,554 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-05 19:56:04,555 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:04,555 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:04,555 INFO  L82        PathProgramCache]: Analyzing trace with hash 1166124987, now seen corresponding path program 1 times
[2021-06-05 19:56:04,555 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:04,555 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017259548]
[2021-06-05 19:56:04,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:04,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:04,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:04,749 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:04,749 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017259548]
[2021-06-05 19:56:04,749 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017259548] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:04,749 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:04,749 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:04,750 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932638247]
[2021-06-05 19:56:04,750 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:04,750 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:04,750 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:04,750 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:04,750 INFO  L87              Difference]: Start difference. First operand 7897 states and 27301 transitions. Second operand  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:05,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:05,825 INFO  L93              Difference]: Finished difference Result 12227 states and 42183 transitions.
[2021-06-05 19:56:05,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2021-06-05 19:56:05,825 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 74
[2021-06-05 19:56:05,826 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:05,840 INFO  L225             Difference]: With dead ends: 12227
[2021-06-05 19:56:05,841 INFO  L226             Difference]: Without dead ends: 5611
[2021-06-05 19:56:05,841 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 539.8ms TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332
[2021-06-05 19:56:05,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5611 states.
[2021-06-05 19:56:05,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5611 to 5233.
[2021-06-05 19:56:06,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5233 states, 5232 states have (on average 3.3298929663608563) internal successors, (17422), 5232 states have internal predecessors, (17422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions.
[2021-06-05 19:56:06,016 INFO  L78                 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 74
[2021-06-05 19:56:06,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:06,016 INFO  L482      AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions.
[2021-06-05 19:56:06,017 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions.
[2021-06-05 19:56:06,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:06,025 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:06,025 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:06,025 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-05 19:56:06,025 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:06,026 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:06,026 INFO  L82        PathProgramCache]: Analyzing trace with hash -2052241606, now seen corresponding path program 1 times
[2021-06-05 19:56:06,026 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:06,026 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407915687]
[2021-06-05 19:56:06,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:06,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:06,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:06,251 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:06,251 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407915687]
[2021-06-05 19:56:06,251 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407915687] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:06,251 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:06,251 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:06,251 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050246754]
[2021-06-05 19:56:06,252 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:06,252 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:06,252 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:06,252 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:06,252 INFO  L87              Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:06,695 INFO  L93              Difference]: Finished difference Result 6719 states and 22349 transitions.
[2021-06-05 19:56:06,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-06-05 19:56:06,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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 77
[2021-06-05 19:56:06,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:06,710 INFO  L225             Difference]: With dead ends: 6719
[2021-06-05 19:56:06,710 INFO  L226             Difference]: Without dead ends: 6099
[2021-06-05 19:56:06,710 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 200.8ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420
[2021-06-05 19:56:06,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6099 states.
[2021-06-05 19:56:06,817 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5615.
[2021-06-05 19:56:06,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5615 states, 5614 states have (on average 3.326861417883862) internal successors, (18677), 5614 states have internal predecessors, (18677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 18677 transitions.
[2021-06-05 19:56:06,839 INFO  L78                 Accepts]: Start accepts. Automaton has 5615 states and 18677 transitions. Word has length 77
[2021-06-05 19:56:06,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:06,840 INFO  L482      AbstractCegarLoop]: Abstraction has 5615 states and 18677 transitions.
[2021-06-05 19:56:06,840 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 5615 states and 18677 transitions.
[2021-06-05 19:56:06,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:06,849 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:06,849 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:06,850 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-05 19:56:06,850 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:06,850 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:06,850 INFO  L82        PathProgramCache]: Analyzing trace with hash 1192464058, now seen corresponding path program 2 times
[2021-06-05 19:56:06,850 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:06,850 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645843762]
[2021-06-05 19:56:06,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:06,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:07,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:07,304 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:07,304 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645843762]
[2021-06-05 19:56:07,304 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645843762] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:07,304 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:07,304 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:07,304 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979443905]
[2021-06-05 19:56:07,305 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:07,305 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:07,305 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:07,305 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:07,305 INFO  L87              Difference]: Start difference. First operand 5615 states and 18677 transitions. Second operand  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:07,816 INFO  L93              Difference]: Finished difference Result 9292 states and 30886 transitions.
[2021-06-05 19:56:07,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:07,817 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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 77
[2021-06-05 19:56:07,817 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:07,834 INFO  L225             Difference]: With dead ends: 9292
[2021-06-05 19:56:07,834 INFO  L226             Difference]: Without dead ends: 6816
[2021-06-05 19:56:07,834 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 410.5ms TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462
[2021-06-05 19:56:07,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6816 states.
[2021-06-05 19:56:07,939 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6816 to 6434.
[2021-06-05 19:56:07,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6434 states, 6433 states have (on average 3.3172703248873) internal successors, (21340), 6433 states have internal predecessors, (21340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 21340 transitions.
[2021-06-05 19:56:08,010 INFO  L78                 Accepts]: Start accepts. Automaton has 6434 states and 21340 transitions. Word has length 77
[2021-06-05 19:56:08,010 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:08,010 INFO  L482      AbstractCegarLoop]: Abstraction has 6434 states and 21340 transitions.
[2021-06-05 19:56:08,011 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 6434 states and 21340 transitions.
[2021-06-05 19:56:08,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:08,020 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:08,020 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:08,021 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-05 19:56:08,021 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:08,021 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:08,021 INFO  L82        PathProgramCache]: Analyzing trace with hash -2103354662, now seen corresponding path program 1 times
[2021-06-05 19:56:08,021 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:08,021 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231132280]
[2021-06-05 19:56:08,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:08,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:08,189 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,189 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231132280]
[2021-06-05 19:56:08,189 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231132280] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,189 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,189 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-05 19:56:08,189 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166288767]
[2021-06-05 19:56:08,190 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-05 19:56:08,190 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,190 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-05 19:56:08,190 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-06-05 19:56:08,190 INFO  L87              Difference]: Start difference. First operand 6434 states and 21340 transitions. Second operand  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:08,585 INFO  L93              Difference]: Finished difference Result 10228 states and 33889 transitions.
[2021-06-05 19:56:08,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:08,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 78
[2021-06-05 19:56:08,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:08,603 INFO  L225             Difference]: With dead ends: 10228
[2021-06-05 19:56:08,603 INFO  L226             Difference]: Without dead ends: 8168
[2021-06-05 19:56:08,603 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 168.6ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:08,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8168 states.
[2021-06-05 19:56:08,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8168 to 6665.
[2021-06-05 19:56:08,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6665 states, 6664 states have (on average 3.2978691476590636) internal successors, (21977), 6664 states have internal predecessors, (21977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 21977 transitions.
[2021-06-05 19:56:08,737 INFO  L78                 Accepts]: Start accepts. Automaton has 6665 states and 21977 transitions. Word has length 78
[2021-06-05 19:56:08,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:08,738 INFO  L482      AbstractCegarLoop]: Abstraction has 6665 states and 21977 transitions.
[2021-06-05 19:56:08,738 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 6665 states and 21977 transitions.
[2021-06-05 19:56:08,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:08,747 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:08,747 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:08,747 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-05 19:56:08,747 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:08,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:08,748 INFO  L82        PathProgramCache]: Analyzing trace with hash 981153988, now seen corresponding path program 1 times
[2021-06-05 19:56:08,748 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:08,748 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423637342]
[2021-06-05 19:56:08,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:08,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:08,889 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,889 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423637342]
[2021-06-05 19:56:08,889 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423637342] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,890 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,890 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-05 19:56:08,890 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779350026]
[2021-06-05 19:56:08,890 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-05 19:56:08,890 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,890 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-05 19:56:08,890 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2021-06-05 19:56:08,890 INFO  L87              Difference]: Start difference. First operand 6665 states and 21977 transitions. Second operand  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,286 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,286 INFO  L93              Difference]: Finished difference Result 10543 states and 34867 transitions.
[2021-06-05 19:56:09,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:09,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 78
[2021-06-05 19:56:09,287 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,307 INFO  L225             Difference]: With dead ends: 10543
[2021-06-05 19:56:09,307 INFO  L226             Difference]: Without dead ends: 8882
[2021-06-05 19:56:09,307 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:09,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8882 states.
[2021-06-05 19:56:09,447 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8882 to 6858.
[2021-06-05 19:56:09,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6858 states, 6857 states have (on average 3.2757765786787223) internal successors, (22462), 6857 states have internal predecessors, (22462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 22462 transitions.
[2021-06-05 19:56:09,473 INFO  L78                 Accepts]: Start accepts. Automaton has 6858 states and 22462 transitions. Word has length 78
[2021-06-05 19:56:09,473 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,473 INFO  L482      AbstractCegarLoop]: Abstraction has 6858 states and 22462 transitions.
[2021-06-05 19:56:09,473 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 6858 states and 22462 transitions.
[2021-06-05 19:56:09,484 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:09,484 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,484 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:09,484 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-05 19:56:09,485 INFO  L430      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,485 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,485 INFO  L82        PathProgramCache]: Analyzing trace with hash 6401276, now seen corresponding path program 2 times
[2021-06-05 19:56:09,485 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,485 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838838848]
[2021-06-05 19:56:09,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:09,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:09,567 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:09,567 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838838848]
[2021-06-05 19:56:09,567 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838838848] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:09,567 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:09,568 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:09,568 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127440549]
[2021-06-05 19:56:09,568 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:09,568 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:09,568 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:09,568 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:09,568 INFO  L87              Difference]: Start difference. First operand 6858 states and 22462 transitions. Second operand  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,738 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,738 INFO  L93              Difference]: Finished difference Result 8314 states and 26825 transitions.
[2021-06-05 19:56:09,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:09,739 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78
[2021-06-05 19:56:09,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,751 INFO  L225             Difference]: With dead ends: 8314
[2021-06-05 19:56:09,752 INFO  L226             Difference]: Without dead ends: 6014
[2021-06-05 19:56:09,752 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 127.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:09,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6014 states.
[2021-06-05 19:56:09,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6014.
[2021-06-05 19:56:09,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6014 states, 6013 states have (on average 3.205887244304008) internal successors, (19277), 6013 states have internal predecessors, (19277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6014 states to 6014 states and 19277 transitions.
[2021-06-05 19:56:09,873 INFO  L78                 Accepts]: Start accepts. Automaton has 6014 states and 19277 transitions. Word has length 78
[2021-06-05 19:56:09,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,873 INFO  L482      AbstractCegarLoop]: Abstraction has 6014 states and 19277 transitions.
[2021-06-05 19:56:09,874 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,874 INFO  L276                IsEmpty]: Start isEmpty. Operand 6014 states and 19277 transitions.
[2021-06-05 19:56:09,885 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-05 19:56:09,885 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,885 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:09,886 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-05 19:56:09,886 INFO  L430      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,886 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,886 INFO  L82        PathProgramCache]: Analyzing trace with hash -2132362663, now seen corresponding path program 1 times
[2021-06-05 19:56:09,886 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,886 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515432707]
[2021-06-05 19:56:09,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:10,000 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,000 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515432707]
[2021-06-05 19:56:10,000 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515432707] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,002 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,002 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-05 19:56:10,002 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134501274]
[2021-06-05 19:56:10,003 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-05 19:56:10,003 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,004 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-05 19:56:10,004 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-05 19:56:10,004 INFO  L87              Difference]: Start difference. First operand 6014 states and 19277 transitions. Second operand  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,119 INFO  L93              Difference]: Finished difference Result 5957 states and 18639 transitions.
[2021-06-05 19:56:10,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:10,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 79
[2021-06-05 19:56:10,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,127 INFO  L225             Difference]: With dead ends: 5957
[2021-06-05 19:56:10,127 INFO  L226             Difference]: Without dead ends: 4181
[2021-06-05 19:56:10,128 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:10,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4181 states.
[2021-06-05 19:56:10,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4148.
[2021-06-05 19:56:10,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4148 states, 4147 states have (on average 3.061490233904027) internal successors, (12696), 4147 states have internal predecessors, (12696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 12696 transitions.
[2021-06-05 19:56:10,207 INFO  L78                 Accepts]: Start accepts. Automaton has 4148 states and 12696 transitions. Word has length 79
[2021-06-05 19:56:10,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:10,207 INFO  L482      AbstractCegarLoop]: Abstraction has 4148 states and 12696 transitions.
[2021-06-05 19:56:10,207 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 4148 states and 12696 transitions.
[2021-06-05 19:56:10,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-05 19:56:10,213 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,213 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:10,213 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-05 19:56:10,213 INFO  L430      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,213 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,213 INFO  L82        PathProgramCache]: Analyzing trace with hash -1707571174, now seen corresponding path program 1 times
[2021-06-05 19:56:10,213 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,215 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173323570]
[2021-06-05 19:56:10,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:10,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:10,336 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,336 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173323570]
[2021-06-05 19:56:10,336 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173323570] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,337 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,338 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-05 19:56:10,338 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813787759]
[2021-06-05 19:56:10,338 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-05 19:56:10,338 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,338 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-05 19:56:10,339 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-05 19:56:10,339 INFO  L87              Difference]: Start difference. First operand 4148 states and 12696 transitions. Second operand  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,447 INFO  L93              Difference]: Finished difference Result 3581 states and 10743 transitions.
[2021-06-05 19:56:10,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:10,448 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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 81
[2021-06-05 19:56:10,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,452 INFO  L225             Difference]: With dead ends: 3581
[2021-06-05 19:56:10,453 INFO  L226             Difference]: Without dead ends: 2737
[2021-06-05 19:56:10,453 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:10,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2737 states.
[2021-06-05 19:56:10,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2121.
[2021-06-05 19:56:10,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2121 states, 2120 states have (on average 2.952358490566038) internal successors, (6259), 2120 states have internal predecessors, (6259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 6259 transitions.
[2021-06-05 19:56:10,491 INFO  L78                 Accepts]: Start accepts. Automaton has 2121 states and 6259 transitions. Word has length 81
[2021-06-05 19:56:10,491 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:10,491 INFO  L482      AbstractCegarLoop]: Abstraction has 2121 states and 6259 transitions.
[2021-06-05 19:56:10,492 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,492 INFO  L276                IsEmpty]: Start isEmpty. Operand 2121 states and 6259 transitions.
[2021-06-05 19:56:10,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:10,496 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,497 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:10,497 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-05 19:56:10,497 INFO  L430      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,497 INFO  L82        PathProgramCache]: Analyzing trace with hash -1526451131, now seen corresponding path program 1 times
[2021-06-05 19:56:10,497 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,497 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231484220]
[2021-06-05 19:56:10,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:10,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:10,711 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,711 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231484220]
[2021-06-05 19:56:10,711 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231484220] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,711 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,711 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:10,711 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524268235]
[2021-06-05 19:56:10,711 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:10,711 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,712 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:10,712 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:10,712 INFO  L87              Difference]: Start difference. First operand 2121 states and 6259 transitions. Second operand  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,959 INFO  L93              Difference]: Finished difference Result 3271 states and 9819 transitions.
[2021-06-05 19:56:10,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-05 19:56:10,960 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:10,960 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,965 INFO  L225             Difference]: With dead ends: 3271
[2021-06-05 19:56:10,965 INFO  L226             Difference]: Without dead ends: 2386
[2021-06-05 19:56:10,965 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 129.2ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:10,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2386 states.
[2021-06-05 19:56:10,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2295.
[2021-06-05 19:56:11,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2295 states, 2294 states have (on average 2.9524847428073233) internal successors, (6773), 2294 states have internal predecessors, (6773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 6773 transitions.
[2021-06-05 19:56:11,006 INFO  L78                 Accepts]: Start accepts. Automaton has 2295 states and 6773 transitions. Word has length 84
[2021-06-05 19:56:11,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:11,006 INFO  L482      AbstractCegarLoop]: Abstraction has 2295 states and 6773 transitions.
[2021-06-05 19:56:11,007 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 2295 states and 6773 transitions.
[2021-06-05 19:56:11,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:11,010 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:11,010 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:11,010 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-05 19:56:11,010 INFO  L430      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:11,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:11,010 INFO  L82        PathProgramCache]: Analyzing trace with hash -723221023, now seen corresponding path program 2 times
[2021-06-05 19:56:11,011 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:11,011 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516603648]
[2021-06-05 19:56:11,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:11,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:11,418 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:11,418 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516603648]
[2021-06-05 19:56:11,418 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516603648] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:11,418 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:11,418 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-06-05 19:56:11,418 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316148366]
[2021-06-05 19:56:11,418 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 17 states
[2021-06-05 19:56:11,418 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:11,419 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-06-05 19:56:11,419 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272
[2021-06-05 19:56:11,419 INFO  L87              Difference]: Start difference. First operand 2295 states and 6773 transitions. Second operand  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,856 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:11,856 INFO  L93              Difference]: Finished difference Result 4192 states and 12545 transitions.
[2021-06-05 19:56:11,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-06-05 19:56:11,857 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:11,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:11,860 INFO  L225             Difference]: With dead ends: 4192
[2021-06-05 19:56:11,860 INFO  L226             Difference]: Without dead ends: 2297
[2021-06-05 19:56:11,860 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 368.9ms TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552
[2021-06-05 19:56:11,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2297 states.
[2021-06-05 19:56:11,888 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2204.
[2021-06-05 19:56:11,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2204 states, 2203 states have (on average 2.9505220154334997) internal successors, (6500), 2203 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 6500 transitions.
[2021-06-05 19:56:11,894 INFO  L78                 Accepts]: Start accepts. Automaton has 2204 states and 6500 transitions. Word has length 84
[2021-06-05 19:56:11,894 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:11,894 INFO  L482      AbstractCegarLoop]: Abstraction has 2204 states and 6500 transitions.
[2021-06-05 19:56:11,894 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 2204 states and 6500 transitions.
[2021-06-05 19:56:11,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:11,897 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:11,897 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:11,897 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-05 19:56:11,897 INFO  L430      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:11,898 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:11,898 INFO  L82        PathProgramCache]: Analyzing trace with hash 1224777667, now seen corresponding path program 3 times
[2021-06-05 19:56:11,898 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:11,898 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562696798]
[2021-06-05 19:56:11,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:12,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:12,070 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:12,070 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562696798]
[2021-06-05 19:56:12,070 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562696798] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:12,070 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:12,070 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-05 19:56:12,070 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361840636]
[2021-06-05 19:56:12,070 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-05 19:56:12,071 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:12,071 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-05 19:56:12,071 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-06-05 19:56:12,071 INFO  L87              Difference]: Start difference. First operand 2204 states and 6500 transitions. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,289 INFO  L93              Difference]: Finished difference Result 2948 states and 8763 transitions.
[2021-06-05 19:56:12,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:12,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:12,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,293 INFO  L225             Difference]: With dead ends: 2948
[2021-06-05 19:56:12,293 INFO  L226             Difference]: Without dead ends: 1994
[2021-06-05 19:56:12,293 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 185.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:12,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1994 states.
[2021-06-05 19:56:12,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1760.
[2021-06-05 19:56:12,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1760 states, 1759 states have (on average 2.8959636156907336) internal successors, (5094), 1759 states have internal predecessors, (5094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 5094 transitions.
[2021-06-05 19:56:12,318 INFO  L78                 Accepts]: Start accepts. Automaton has 1760 states and 5094 transitions. Word has length 84
[2021-06-05 19:56:12,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,318 INFO  L482      AbstractCegarLoop]: Abstraction has 1760 states and 5094 transitions.
[2021-06-05 19:56:12,319 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 1760 states and 5094 transitions.
[2021-06-05 19:56:12,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,321 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,321 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:12,321 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-05 19:56:12,321 INFO  L430      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,321 INFO  L82        PathProgramCache]: Analyzing trace with hash 1403968075, now seen corresponding path program 4 times
[2021-06-05 19:56:12,322 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,322 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147278392]
[2021-06-05 19:56:12,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:12,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:12,504 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:12,504 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147278392]
[2021-06-05 19:56:12,504 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147278392] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:12,504 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:12,504 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:12,504 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579007422]
[2021-06-05 19:56:12,505 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:12,505 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:12,505 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:12,505 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:12,505 INFO  L87              Difference]: Start difference. First operand 1760 states and 5094 transitions. Second operand  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,878 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,878 INFO  L93              Difference]: Finished difference Result 3416 states and 10131 transitions.
[2021-06-05 19:56:12,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:12,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:12,879 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,882 INFO  L225             Difference]: With dead ends: 3416
[2021-06-05 19:56:12,882 INFO  L226             Difference]: Without dead ends: 2343
[2021-06-05 19:56:12,882 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 199.5ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342
[2021-06-05 19:56:12,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2343 states.
[2021-06-05 19:56:12,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1524.
[2021-06-05 19:56:12,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1524 states, 1523 states have (on average 2.871306631648063) internal successors, (4373), 1523 states have internal predecessors, (4373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 4373 transitions.
[2021-06-05 19:56:12,909 INFO  L78                 Accepts]: Start accepts. Automaton has 1524 states and 4373 transitions. Word has length 84
[2021-06-05 19:56:12,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,909 INFO  L482      AbstractCegarLoop]: Abstraction has 1524 states and 4373 transitions.
[2021-06-05 19:56:12,909 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 1524 states and 4373 transitions.
[2021-06-05 19:56:12,911 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,911 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,911 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:12,911 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-05 19:56:12,911 INFO  L430      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,911 INFO  L82        PathProgramCache]: Analyzing trace with hash 267113955, now seen corresponding path program 5 times
[2021-06-05 19:56:12,911 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,911 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42151565]
[2021-06-05 19:56:12,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:13,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:13,091 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:13,091 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42151565]
[2021-06-05 19:56:13,091 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42151565] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:13,091 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:13,091 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:13,091 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933365237]
[2021-06-05 19:56:13,092 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:13,092 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:13,092 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:13,092 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:13,092 INFO  L87              Difference]: Start difference. First operand 1524 states and 4373 transitions. Second operand  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:13,361 INFO  L93              Difference]: Finished difference Result 3429 states and 10269 transitions.
[2021-06-05 19:56:13,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:13,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:13,362 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:13,364 INFO  L225             Difference]: With dead ends: 3429
[2021-06-05 19:56:13,364 INFO  L226             Difference]: Without dead ends: 1843
[2021-06-05 19:56:13,364 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 194.4ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342
[2021-06-05 19:56:13,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1843 states.
[2021-06-05 19:56:13,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1288.
[2021-06-05 19:56:13,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1288 states, 1287 states have (on average 2.849261849261849) internal successors, (3667), 1287 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3667 transitions.
[2021-06-05 19:56:13,383 INFO  L78                 Accepts]: Start accepts. Automaton has 1288 states and 3667 transitions. Word has length 84
[2021-06-05 19:56:13,383 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:13,383 INFO  L482      AbstractCegarLoop]: Abstraction has 1288 states and 3667 transitions.
[2021-06-05 19:56:13,383 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,383 INFO  L276                IsEmpty]: Start isEmpty. Operand 1288 states and 3667 transitions.
[2021-06-05 19:56:13,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:13,385 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:13,385 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:13,385 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-05 19:56:13,385 INFO  L430      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:13,385 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:13,385 INFO  L82        PathProgramCache]: Analyzing trace with hash -126320827, now seen corresponding path program 6 times
[2021-06-05 19:56:13,385 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:13,385 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754725740]
[2021-06-05 19:56:13,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:13,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:13,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:13,525 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:13,525 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754725740]
[2021-06-05 19:56:13,525 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754725740] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:13,525 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:13,525 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-05 19:56:13,525 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149332706]
[2021-06-05 19:56:13,525 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-05 19:56:13,525 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:13,526 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-05 19:56:13,526 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2021-06-05 19:56:13,526 INFO  L87              Difference]: Start difference. First operand 1288 states and 3667 transitions. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:13,655 INFO  L93              Difference]: Finished difference Result 2014 states and 5867 transitions.
[2021-06-05 19:56:13,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:13,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:13,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:13,657 INFO  L225             Difference]: With dead ends: 2014
[2021-06-05 19:56:13,657 INFO  L226             Difference]: Without dead ends: 1067
[2021-06-05 19:56:13,657 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.9ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:13,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1067 states.
[2021-06-05 19:56:13,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067.
[2021-06-05 19:56:13,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1067 states, 1066 states have (on average 2.8818011257035647) internal successors, (3072), 1066 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3072 transitions.
[2021-06-05 19:56:13,675 INFO  L78                 Accepts]: Start accepts. Automaton has 1067 states and 3072 transitions. Word has length 84
[2021-06-05 19:56:13,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:13,675 INFO  L482      AbstractCegarLoop]: Abstraction has 1067 states and 3072 transitions.
[2021-06-05 19:56:13,675 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 1067 states and 3072 transitions.
[2021-06-05 19:56:13,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:13,676 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:13,676 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:13,676 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-06-05 19:56:13,676 INFO  L430      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:13,677 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:13,677 INFO  L82        PathProgramCache]: Analyzing trace with hash -1584977595, now seen corresponding path program 7 times
[2021-06-05 19:56:13,677 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:13,677 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663472202]
[2021-06-05 19:56:13,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:13,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:14,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:14,250 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:14,250 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663472202]
[2021-06-05 19:56:14,250 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663472202] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:14,250 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:14,250 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2021-06-05 19:56:14,250 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263287334]
[2021-06-05 19:56:14,250 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 18 states
[2021-06-05 19:56:14,250 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:14,251 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2021-06-05 19:56:14,251 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:14,251 INFO  L87              Difference]: Start difference. First operand 1067 states and 3072 transitions. Second operand  has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:14,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:14,924 INFO  L93              Difference]: Finished difference Result 2327 states and 6888 transitions.
[2021-06-05 19:56:14,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-06-05 19:56:14,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 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 84
[2021-06-05 19:56:14,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:14,926 INFO  L225             Difference]: With dead ends: 2327
[2021-06-05 19:56:14,926 INFO  L226             Difference]: Without dead ends: 923
[2021-06-05 19:56:14,926 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 734.5ms TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702
[2021-06-05 19:56:14,928 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 923 states.
[2021-06-05 19:56:14,935 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923.
[2021-06-05 19:56:14,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 923 states, 922 states have (on average 2.811279826464208) internal successors, (2592), 922 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:14,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2592 transitions.
[2021-06-05 19:56:14,938 INFO  L78                 Accepts]: Start accepts. Automaton has 923 states and 2592 transitions. Word has length 84
[2021-06-05 19:56:14,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:14,938 INFO  L482      AbstractCegarLoop]: Abstraction has 923 states and 2592 transitions.
[2021-06-05 19:56:14,938 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:14,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 923 states and 2592 transitions.
[2021-06-05 19:56:14,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:14,939 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:14,939 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:14,939 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-05 19:56:14,939 INFO  L430      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:14,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:14,940 INFO  L82        PathProgramCache]: Analyzing trace with hash -1003033753, now seen corresponding path program 8 times
[2021-06-05 19:56:14,940 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:14,940 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63756833]
[2021-06-05 19:56:14,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:15,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:15,009 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:15,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:15,089 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:15,132 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-05 19:56:15,132 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-05 19:56:15,132 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-05 19:56:15,132 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-05 19:56:15,133 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-05 19:56:15,263 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:56:15 BasicIcfg
[2021-06-05 19:56:15,263 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: Toolchain (without parser) took 18921.11 ms. Allocated memory was 383.8 MB in the beginning and 5.4 GB in the end (delta: 5.0 GB). Free memory was 345.7 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 383.8 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 374.65 ms. Allocated memory is still 383.8 MB. Free memory was 345.6 MB in the beginning and 339.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 383.8 MB. Free memory was 339.3 MB in the beginning and 336.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: Boogie Preprocessor took 47.34 ms. Allocated memory is still 383.8 MB. Free memory was 336.2 MB in the beginning and 333.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: RCFGBuilder took 2381.25 ms. Allocated memory was 383.8 MB in the beginning and 476.1 MB in the end (delta: 92.3 MB). Free memory was 333.0 MB in the beginning and 290.4 MB in the end (delta: 42.6 MB). Peak memory consumption was 157.0 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,264 INFO  L168              Benchmark]: TraceAbstraction took 16071.51 ms. Allocated memory was 476.1 MB in the beginning and 5.4 GB in the end (delta: 4.9 GB). Free memory was 290.4 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB.
[2021-06-05 19:56:15,265 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.13 ms. Allocated memory is still 383.8 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 374.65 ms. Allocated memory is still 383.8 MB. Free memory was 345.6 MB in the beginning and 339.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 383.8 MB. Free memory was 339.3 MB in the beginning and 336.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 47.34 ms. Allocated memory is still 383.8 MB. Free memory was 336.2 MB in the beginning and 333.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2381.25 ms. Allocated memory was 383.8 MB in the beginning and 476.1 MB in the end (delta: 92.3 MB). Free memory was 333.0 MB in the beginning and 290.4 MB in the end (delta: 42.6 MB). Peak memory consumption was 157.0 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 16071.51 ms. Allocated memory was 476.1 MB in the beginning and 5.4 GB in the end (delta: 4.9 GB). Free memory was 290.4 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 19]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L712]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L714]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0]
[L716]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L720]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L724]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L725]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L726]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L727]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L728]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L729]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L730]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L731]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L732]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L733]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L734]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L735]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L736]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L737]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L738]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L739]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L740]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L854]               0  pthread_t t2333;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L855]  FCALL, FORK  0  pthread_create(&t2333, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L856]               0  pthread_t t2334;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L857]  FCALL, FORK  0  pthread_create(&t2334, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L784]               2  y$w_buff1 = y$w_buff0
[L785]               2  y$w_buff0 = 2
[L786]               2  y$w_buff1_used = y$w_buff0_used
[L787]               2  y$w_buff0_used = (_Bool)1
[L19]   COND FALSE   2  !(!expression)
[L789]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L790]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L791]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L792]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L793]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L858]               0  pthread_t t2335;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L859]  FCALL, FORK  0  pthread_create(&t2335, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L813]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L816]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               3  y$flush_delayed = weak$$choice2
[L819]               3  y$mem_tmp = y
[L820]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L820]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  __unbuffered_p2_EBX = y
[L828]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L828]               3  y = y$flush_delayed ? y$mem_tmp : y
[L829]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L744]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L748]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L751]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = y
[L766]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L771]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L771]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L772]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L773]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L774]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L774]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L799]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L800]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L800]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L801]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L802]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L802]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L803]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L803]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L833]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L834]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L835]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L836]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L836]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L4]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L867]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L869]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L872]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L873]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L874]               0  y$flush_delayed = weak$$choice2
[L875]               0  y$mem_tmp = y
[L876]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L876]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L883]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L884]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L884]               0  y = y$flush_delayed ? y$mem_tmp : y
[L885]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L19]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L19]                0  reach_error()
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 946.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 118.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 825.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork2 with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1401.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 34.8ms, AutomataDifference: 381.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 799.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 40 SDslu, 72 SDs, 0 SdLazy, 17 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.8ms SsaConstructionTime, 26.9ms SatisfiabilityAnalysisTime, 77.4ms InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13459.1ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 134.8ms, AutomataDifference: 6826.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 641.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2554 SDtfs, 4586 SDslu, 13795 SDs, 0 SdLazy, 2969 SolverSat, 555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2727.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 4139.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1848.4ms AutomataMinimizationTime, 17 MinimizatonAttempts, 7590 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 60.9ms SsaConstructionTime, 899.3ms SatisfiabilityAnalysisTime, 2795.4ms InterpolantComputationTime, 1434 NumberOfCodeBlocks, 1434 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1333 ConstructedInterpolants, 0 QuantifiedInterpolants, 9786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...