/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/safe029_power.oepc.i


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


This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 16:35:02,736 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-01 16:35:02,741 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 16:35:02,778 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 16:35:02,778 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 16:35:02,781 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 16:35:02,783 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 16:35:02,789 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 16:35:02,791 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 16:35:02,795 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 16:35:02,795 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 16:35:02,797 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 16:35:02,797 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 16:35:02,799 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 16:35:02,800 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 16:35:02,801 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 16:35:02,803 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 16:35:02,804 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 16:35:02,806 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 16:35:02,811 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 16:35:02,813 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 16:35:02,814 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 16:35:02,814 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 16:35:02,816 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 16:35:02,822 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 16:35:02,822 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 16:35:02,822 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 16:35:02,824 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 16:35:02,824 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 16:35:02,825 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 16:35:02,825 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 16:35:02,826 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 16:35:02,827 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 16:35:02,828 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 16:35:02,828 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 16:35:02,829 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 16:35:02,829 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 16:35:02,829 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 16:35:02,830 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 16:35:02,830 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 16:35:02,831 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 16:35:02,835 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-01 16:35:02,870 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-01 16:35:02,871 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 16:35:02,871 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 16:35:02,872 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 16:35:02,874 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 16:35:02,874 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-01 16:35:02,874 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-01 16:35:02,874 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 16:35:02,875 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-01 16:35:02,875 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-01 16:35:02,875 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-01 16:35:02,876 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-01 16:35:02,877 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-01 16:35:02,877 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:35:02,878 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 16:35:02,878 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 16:35:02,878 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 16:35:02,878 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-01 16:35:02,878 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 16:35:02,878 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-01 16:35:02,879 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 16:35:02,879 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-01 16:35:03,183 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 16:35:03,205 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 16:35:03,207 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 16:35:03,208 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-01 16:35:03,209 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-01 16:35:03,209 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i
[2021-06-01 16:35:03,296 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162f5279e/ba67d14389294821918d6a44fd0832f4/FLAGda185544c
[2021-06-01 16:35:04,003 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-01 16:35:04,003 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i
[2021-06-01 16:35:04,020 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162f5279e/ba67d14389294821918d6a44fd0832f4/FLAGda185544c
[2021-06-01 16:35:04,269 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162f5279e/ba67d14389294821918d6a44fd0832f4
[2021-06-01 16:35:04,272 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 16:35:04,274 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 16:35:04,278 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 16:35:04,278 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 16:35:04,281 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 16:35:04,282 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,283 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76947be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04, skipping insertion in model container
[2021-06-01 16:35:04,283 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,289 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-01 16:35:04,335 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-01 16:35:04,447 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/safe029_power.oepc.i[952,965]
[2021-06-01 16:35:04,625 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:35:04,637 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-01 16:35:04,647 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/safe029_power.oepc.i[952,965]
[2021-06-01 16:35:04,710 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:35:04,782 INFO  L208         MainTranslator]: Completed translation
[2021-06-01 16:35:04,782 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04 WrapperNode
[2021-06-01 16:35:04,782 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 16:35:04,783 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 16:35:04,783 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 16:35:04,783 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 16:35:04,789 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,809 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,835 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 16:35:04,835 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 16:35:04,836 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 16:35:04,836 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 16:35:04,847 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,847 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,851 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,851 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,860 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,863 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,866 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
[2021-06-01 16:35:04,870 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 16:35:04,871 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 16:35:04,871 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 16:35:04,871 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-01 16:35:04,872 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 16:35:04,939 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 16:35:04,939 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 16:35:04,940 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 16:35:04,940 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 16:35:04,940 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 16:35:04,940 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 16:35:04,940 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 16:35:04,941 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 16:35:06,453 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 16:35:06,454 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 16:35:06,457 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:35:06 BoogieIcfgContainer
[2021-06-01 16:35:06,458 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 16:35:06,460 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 16:35:06,460 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 16:35:06,462 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-01 16:35:06,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:35:04" (1/3) ...
[2021-06-01 16:35:06,463 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d176c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:35:06, skipping insertion in model container
[2021-06-01 16:35:06,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:04" (2/3) ...
[2021-06-01 16:35:06,464 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d176c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:35:06, skipping insertion in model container
[2021-06-01 16:35:06,464 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:35:06" (3/3) ...
[2021-06-01 16:35:06,465 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i
[2021-06-01 16:35:06,471 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 16:35:06,471 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 16:35:06,471 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 16:35:06,472 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 16:35:06,501 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,501 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,501 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,501 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,501 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,502 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,503 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,503 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,503 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,503 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,503 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,508 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,508 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,508 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,509 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,509 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,513 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,514 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,515 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,516 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,516 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,517 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,519 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,519 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,519 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,519 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:06,520 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 16:35:06,541 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:35:06,565 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:06,566 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:06,566 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:06,566 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:06,566 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:06,566 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:06,566 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:06,566 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0========
[2021-06-01 16:35:06,575 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow
[2021-06-01 16:35:06,651 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:06,657 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:06,677 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:35:06,678 INFO  L301   ceAbstractionStarter]: Result for error location P0 was SAFE (1/3)
[2021-06-01 16:35:06,680 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2021-06-01 16:35:06,681 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:06,682 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:06,682 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:06,682 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:06,682 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:06,682 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:06,682 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:06,682 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 16:35:06,684 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow
[2021-06-01 16:35:06,731 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:06,735 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:06,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2021-06-01 16:35:06,739 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:06,740 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]
[2021-06-01 16:35:06,740 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:06,745 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:06,745 INFO  L82        PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times
[2021-06-01 16:35:06,752 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:06,753 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218525920]
[2021-06-01 16:35:06,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:06,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:07,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:07,187 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:07,188 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218525920]
[2021-06-01 16:35:07,189 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218525920] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:07,189 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:07,189 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:07,190 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834704716]
[2021-06-01 16:35:07,193 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:07,194 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:07,212 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:07,213 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:07,221 INFO  L87              Difference]: Start difference. First operand  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:07,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:07,395 INFO  L93              Difference]: Finished difference Result 2578 states and 6846 transitions.
[2021-06-01 16:35:07,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:35:07,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 56
[2021-06-01 16:35:07,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:07,418 INFO  L225             Difference]: With dead ends: 2578
[2021-06-01 16:35:07,418 INFO  L226             Difference]: Without dead ends: 1130
[2021-06-01 16:35:07,419 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:07,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1130 states.
[2021-06-01 16:35:07,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130.
[2021-06-01 16:35:07,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1130 states, 1128 states have (on average 2.5913120567375887) internal successors, (2923), 1129 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:07,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2923 transitions.
[2021-06-01 16:35:07,526 INFO  L78                 Accepts]: Start accepts. Automaton has 1130 states and 2923 transitions. Word has length 56
[2021-06-01 16:35:07,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:07,526 INFO  L482      AbstractCegarLoop]: Abstraction has 1130 states and 2923 transitions.
[2021-06-01 16:35:07,527 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:07,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 1130 states and 2923 transitions.
[2021-06-01 16:35:07,534 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2021-06-01 16:35:07,534 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:07,534 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]
[2021-06-01 16:35:07,535 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 16:35:07,535 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:07,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:07,535 INFO  L82        PathProgramCache]: Analyzing trace with hash -1550290026, now seen corresponding path program 1 times
[2021-06-01 16:35:07,536 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:07,536 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131534429]
[2021-06-01 16:35:07,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:07,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:07,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:07,901 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:07,901 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131534429]
[2021-06-01 16:35:07,902 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131534429] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:07,902 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:07,902 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:35:07,903 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741041732]
[2021-06-01 16:35:07,904 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:35:07,905 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:07,906 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:35:07,933 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:35:07,933 INFO  L87              Difference]: Start difference. First operand 1130 states and 2923 transitions. Second operand  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:08,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:08,251 INFO  L93              Difference]: Finished difference Result 1306 states and 3336 transitions.
[2021-06-01 16:35:08,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-06-01 16:35:08,256 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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 58
[2021-06-01 16:35:08,256 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:08,261 INFO  L225             Difference]: With dead ends: 1306
[2021-06-01 16:35:08,261 INFO  L226             Difference]: Without dead ends: 1054
[2021-06-01 16:35:08,261 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 279.3ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:35:08,265 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1054 states.
[2021-06-01 16:35:08,285 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054.
[2021-06-01 16:35:08,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1054 states, 1052 states have (on average 2.571292775665399) internal successors, (2705), 1053 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:08,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 2705 transitions.
[2021-06-01 16:35:08,291 INFO  L78                 Accepts]: Start accepts. Automaton has 1054 states and 2705 transitions. Word has length 58
[2021-06-01 16:35:08,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:08,292 INFO  L482      AbstractCegarLoop]: Abstraction has 1054 states and 2705 transitions.
[2021-06-01 16:35:08,292 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:08,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 1054 states and 2705 transitions.
[2021-06-01 16:35:08,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2021-06-01 16:35:08,294 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:08,294 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]
[2021-06-01 16:35:08,295 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 16:35:08,295 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:08,295 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:08,295 INFO  L82        PathProgramCache]: Analyzing trace with hash 1756957986, now seen corresponding path program 1 times
[2021-06-01 16:35:08,295 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:08,296 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244557964]
[2021-06-01 16:35:08,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:08,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:08,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:08,572 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:08,573 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244557964]
[2021-06-01 16:35:08,573 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244557964] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:08,573 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:08,573 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:35:08,573 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423145794]
[2021-06-01 16:35:08,574 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:35:08,574 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:08,574 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:35:08,575 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:35:08,575 INFO  L87              Difference]: Start difference. First operand 1054 states and 2705 transitions. Second operand  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:09,169 INFO  L93              Difference]: Finished difference Result 1079 states and 2730 transitions.
[2021-06-01 16:35:09,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2021-06-01 16:35:09,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 59
[2021-06-01 16:35:09,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:09,176 INFO  L225             Difference]: With dead ends: 1079
[2021-06-01 16:35:09,176 INFO  L226             Difference]: Without dead ends: 919
[2021-06-01 16:35:09,177 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 420.7ms TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702
[2021-06-01 16:35:09,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 919 states.
[2021-06-01 16:35:09,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919.
[2021-06-01 16:35:09,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 919 states, 918 states have (on average 2.5403050108932463) internal successors, (2332), 918 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2332 transitions.
[2021-06-01 16:35:09,198 INFO  L78                 Accepts]: Start accepts. Automaton has 919 states and 2332 transitions. Word has length 59
[2021-06-01 16:35:09,198 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:09,198 INFO  L482      AbstractCegarLoop]: Abstraction has 919 states and 2332 transitions.
[2021-06-01 16:35:09,199 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,201 INFO  L276                IsEmpty]: Start isEmpty. Operand 919 states and 2332 transitions.
[2021-06-01 16:35:09,203 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2021-06-01 16:35:09,203 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:09,203 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:09,208 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 16:35:09,208 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:09,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:09,210 INFO  L82        PathProgramCache]: Analyzing trace with hash -1303999016, now seen corresponding path program 1 times
[2021-06-01 16:35:09,210 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:09,211 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676192068]
[2021-06-01 16:35:09,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:09,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:09,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:09,345 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:09,345 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676192068]
[2021-06-01 16:35:09,346 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676192068] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:09,346 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:09,346 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:09,346 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20985372]
[2021-06-01 16:35:09,346 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:09,346 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:09,347 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:09,347 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:09,347 INFO  L87              Difference]: Start difference. First operand 919 states and 2332 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:09,436 INFO  L93              Difference]: Finished difference Result 1535 states and 3862 transitions.
[2021-06-01 16:35:09,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:35:09,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2021-06-01 16:35:09,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:09,441 INFO  L225             Difference]: With dead ends: 1535
[2021-06-01 16:35:09,441 INFO  L226             Difference]: Without dead ends: 1021
[2021-06-01 16:35:09,441 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:09,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1021 states.
[2021-06-01 16:35:09,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 871.
[2021-06-01 16:35:09,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 871 states, 870 states have (on average 2.466666666666667) internal successors, (2146), 870 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions.
[2021-06-01 16:35:09,463 INFO  L78                 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60
[2021-06-01 16:35:09,463 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:09,463 INFO  L482      AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions.
[2021-06-01 16:35:09,463 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,464 INFO  L276                IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions.
[2021-06-01 16:35:09,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-06-01 16:35:09,465 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:09,465 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]
[2021-06-01 16:35:09,465 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 16:35:09,466 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:09,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:09,466 INFO  L82        PathProgramCache]: Analyzing trace with hash -638334108, now seen corresponding path program 1 times
[2021-06-01 16:35:09,466 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:09,466 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270471]
[2021-06-01 16:35:09,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:09,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:09,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:09,649 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:09,649 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270471]
[2021-06-01 16:35:09,649 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270471] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:09,649 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:09,650 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:35:09,650 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844556513]
[2021-06-01 16:35:09,650 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:35:09,650 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:09,650 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:35:09,651 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:09,651 INFO  L87              Difference]: Start difference. First operand 871 states and 2146 transitions. Second operand  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:09,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:09,992 INFO  L93              Difference]: Finished difference Result 1130 states and 2759 transitions.
[2021-06-01 16:35:09,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-01 16:35:09,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 61
[2021-06-01 16:35:09,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:09,998 INFO  L225             Difference]: With dead ends: 1130
[2021-06-01 16:35:09,998 INFO  L226             Difference]: Without dead ends: 870
[2021-06-01 16:35:09,998 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 263.2ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:35:10,001 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 870 states.
[2021-06-01 16:35:10,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 808.
[2021-06-01 16:35:10,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 808 states, 807 states have (on average 2.422552664188352) internal successors, (1955), 807 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:10,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1955 transitions.
[2021-06-01 16:35:10,018 INFO  L78                 Accepts]: Start accepts. Automaton has 808 states and 1955 transitions. Word has length 61
[2021-06-01 16:35:10,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:10,019 INFO  L482      AbstractCegarLoop]: Abstraction has 808 states and 1955 transitions.
[2021-06-01 16:35:10,019 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:10,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 808 states and 1955 transitions.
[2021-06-01 16:35:10,021 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-06-01 16:35:10,021 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:10,021 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]
[2021-06-01 16:35:10,021 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 16:35:10,021 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:10,022 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:10,022 INFO  L82        PathProgramCache]: Analyzing trace with hash 1801678580, now seen corresponding path program 2 times
[2021-06-01 16:35:10,022 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:10,024 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753059095]
[2021-06-01 16:35:10,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:10,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:10,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-01 16:35:10,303 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:10,303 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753059095]
[2021-06-01 16:35:10,303 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753059095] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:10,303 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:10,303 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:35:10,304 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491865379]
[2021-06-01 16:35:10,304 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:35:10,304 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:10,304 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:35:10,305 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:10,305 INFO  L87              Difference]: Start difference. First operand 808 states and 1955 transitions. Second operand  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:10,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:10,690 INFO  L93              Difference]: Finished difference Result 993 states and 2410 transitions.
[2021-06-01 16:35:10,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-06-01 16:35:10,690 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 61
[2021-06-01 16:35:10,690 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:10,694 INFO  L225             Difference]: With dead ends: 993
[2021-06-01 16:35:10,694 INFO  L226             Difference]: Without dead ends: 873
[2021-06-01 16:35:10,695 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 277.3ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462
[2021-06-01 16:35:10,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 873 states.
[2021-06-01 16:35:10,709 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 813.
[2021-06-01 16:35:10,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 813 states, 812 states have (on average 2.41871921182266) internal successors, (1964), 812 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:10,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1964 transitions.
[2021-06-01 16:35:10,713 INFO  L78                 Accepts]: Start accepts. Automaton has 813 states and 1964 transitions. Word has length 61
[2021-06-01 16:35:10,714 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:10,714 INFO  L482      AbstractCegarLoop]: Abstraction has 813 states and 1964 transitions.
[2021-06-01 16:35:10,714 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:10,714 INFO  L276                IsEmpty]: Start isEmpty. Operand 813 states and 1964 transitions.
[2021-06-01 16:35:10,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-06-01 16:35:10,715 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:10,716 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]
[2021-06-01 16:35:10,716 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 16:35:10,716 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:10,716 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:10,716 INFO  L82        PathProgramCache]: Analyzing trace with hash 2087995442, now seen corresponding path program 3 times
[2021-06-01 16:35:10,716 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:10,717 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620215635]
[2021-06-01 16:35:10,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:10,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:10,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:10,839 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:10,839 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620215635]
[2021-06-01 16:35:10,839 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620215635] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:10,839 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:10,840 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 16:35:10,840 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215419600]
[2021-06-01 16:35:10,840 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 16:35:10,840 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:10,840 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 16:35:10,841 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2021-06-01 16:35:10,841 INFO  L87              Difference]: Start difference. First operand 813 states and 1964 transitions. Second operand  has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:11,034 INFO  L93              Difference]: Finished difference Result 997 states and 2417 transitions.
[2021-06-01 16:35:11,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 16:35:11,034 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 61
[2021-06-01 16:35:11,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:11,038 INFO  L225             Difference]: With dead ends: 997
[2021-06-01 16:35:11,038 INFO  L226             Difference]: Without dead ends: 861
[2021-06-01 16:35:11,039 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 138.1ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:35:11,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 861 states.
[2021-06-01 16:35:11,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 823.
[2021-06-01 16:35:11,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 823 states, 822 states have (on average 2.429440389294404) internal successors, (1997), 822 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1997 transitions.
[2021-06-01 16:35:11,065 INFO  L78                 Accepts]: Start accepts. Automaton has 823 states and 1997 transitions. Word has length 61
[2021-06-01 16:35:11,065 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:11,065 INFO  L482      AbstractCegarLoop]: Abstraction has 823 states and 1997 transitions.
[2021-06-01 16:35:11,065 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,065 INFO  L276                IsEmpty]: Start isEmpty. Operand 823 states and 1997 transitions.
[2021-06-01 16:35:11,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2021-06-01 16:35:11,066 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:11,067 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]
[2021-06-01 16:35:11,067 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 16:35:11,067 INFO  L430      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:11,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:11,067 INFO  L82        PathProgramCache]: Analyzing trace with hash -1930029783, now seen corresponding path program 1 times
[2021-06-01 16:35:11,067 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:11,068 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655275282]
[2021-06-01 16:35:11,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:11,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:11,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:11,372 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:11,373 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655275282]
[2021-06-01 16:35:11,373 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655275282] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:11,373 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:11,373 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:35:11,373 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93457421]
[2021-06-01 16:35:11,374 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:35:11,374 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:11,374 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:35:11,374 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:35:11,374 INFO  L87              Difference]: Start difference. First operand 823 states and 1997 transitions. Second operand  has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,653 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:11,653 INFO  L93              Difference]: Finished difference Result 964 states and 2301 transitions.
[2021-06-01 16:35:11,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-01 16:35:11,654 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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 62
[2021-06-01 16:35:11,654 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:11,656 INFO  L225             Difference]: With dead ends: 964
[2021-06-01 16:35:11,656 INFO  L226             Difference]: Without dead ends: 805
[2021-06-01 16:35:11,657 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 255.2ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:35:11,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 805 states.
[2021-06-01 16:35:11,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805.
[2021-06-01 16:35:11,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 805 states, 804 states have (on average 2.4191542288557213) internal successors, (1945), 804 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1945 transitions.
[2021-06-01 16:35:11,677 INFO  L78                 Accepts]: Start accepts. Automaton has 805 states and 1945 transitions. Word has length 62
[2021-06-01 16:35:11,677 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:11,677 INFO  L482      AbstractCegarLoop]: Abstraction has 805 states and 1945 transitions.
[2021-06-01 16:35:11,677 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:11,677 INFO  L276                IsEmpty]: Start isEmpty. Operand 805 states and 1945 transitions.
[2021-06-01 16:35:11,679 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2021-06-01 16:35:11,679 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:11,679 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]
[2021-06-01 16:35:11,679 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 16:35:11,679 INFO  L430      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:11,680 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:11,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 695919513, now seen corresponding path program 2 times
[2021-06-01 16:35:11,680 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:11,680 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195103326]
[2021-06-01 16:35:11,680 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:11,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:11,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:11,929 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:11,930 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195103326]
[2021-06-01 16:35:11,930 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195103326] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:11,930 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:11,930 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:35:11,930 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979009990]
[2021-06-01 16:35:11,930 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:35:11,930 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:11,931 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:35:11,931 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:35:11,931 INFO  L87              Difference]: Start difference. First operand 805 states and 1945 transitions. Second operand  has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:12,326 INFO  L93              Difference]: Finished difference Result 1181 states and 2835 transitions.
[2021-06-01 16:35:12,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-01 16:35:12,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 62
[2021-06-01 16:35:12,327 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:12,330 INFO  L225             Difference]: With dead ends: 1181
[2021-06-01 16:35:12,330 INFO  L226             Difference]: Without dead ends: 769
[2021-06-01 16:35:12,331 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 388.7ms TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380
[2021-06-01 16:35:12,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 769 states.
[2021-06-01 16:35:12,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 649.
[2021-06-01 16:35:12,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 649 states, 648 states have (on average 2.3580246913580245) internal successors, (1528), 648 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1528 transitions.
[2021-06-01 16:35:12,345 INFO  L78                 Accepts]: Start accepts. Automaton has 649 states and 1528 transitions. Word has length 62
[2021-06-01 16:35:12,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:12,345 INFO  L482      AbstractCegarLoop]: Abstraction has 649 states and 1528 transitions.
[2021-06-01 16:35:12,346 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 649 states and 1528 transitions.
[2021-06-01 16:35:12,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2021-06-01 16:35:12,347 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:12,347 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]
[2021-06-01 16:35:12,347 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 16:35:12,347 INFO  L430      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:12,348 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:12,348 INFO  L82        PathProgramCache]: Analyzing trace with hash -80791419, now seen corresponding path program 1 times
[2021-06-01 16:35:12,348 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:12,348 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336921947]
[2021-06-01 16:35:12,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:12,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:12,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:12,416 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:12,416 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336921947]
[2021-06-01 16:35:12,416 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336921947] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:12,416 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:12,416 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:12,417 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673370216]
[2021-06-01 16:35:12,417 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:12,417 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:12,417 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:12,417 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:12,418 INFO  L87              Difference]: Start difference. First operand 649 states and 1528 transitions. Second operand  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:12,500 INFO  L93              Difference]: Finished difference Result 719 states and 1652 transitions.
[2021-06-01 16:35:12,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:35:12,501 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 62
[2021-06-01 16:35:12,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:12,503 INFO  L225             Difference]: With dead ends: 719
[2021-06-01 16:35:12,503 INFO  L226             Difference]: Without dead ends: 535
[2021-06-01 16:35:12,503 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:12,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 535 states.
[2021-06-01 16:35:12,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535.
[2021-06-01 16:35:12,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions.
[2021-06-01 16:35:12,514 INFO  L78                 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62
[2021-06-01 16:35:12,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:12,514 INFO  L482      AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions.
[2021-06-01 16:35:12,514 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions.
[2021-06-01 16:35:12,515 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2021-06-01 16:35:12,516 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:12,516 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]
[2021-06-01 16:35:12,516 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 16:35:12,516 INFO  L430      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:12,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:12,516 INFO  L82        PathProgramCache]: Analyzing trace with hash -615861270, now seen corresponding path program 1 times
[2021-06-01 16:35:12,516 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:12,517 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353803116]
[2021-06-01 16:35:12,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:12,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:12,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:12,590 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:12,590 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353803116]
[2021-06-01 16:35:12,590 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353803116] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:12,590 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:12,591 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:35:12,591 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026840446]
[2021-06-01 16:35:12,591 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:35:12,591 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:12,591 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:35:12,592 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:35:12,592 INFO  L87              Difference]: Start difference. First operand 535 states and 1210 transitions. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:12,695 INFO  L93              Difference]: Finished difference Result 457 states and 987 transitions.
[2021-06-01 16:35:12,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-01 16:35:12,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 63
[2021-06-01 16:35:12,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:12,697 INFO  L225             Difference]: With dead ends: 457
[2021-06-01 16:35:12,697 INFO  L226             Difference]: Without dead ends: 273
[2021-06-01 16:35:12,697 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 92.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:35:12,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2021-06-01 16:35:12,701 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273.
[2021-06-01 16:35:12,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions.
[2021-06-01 16:35:12,702 INFO  L78                 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63
[2021-06-01 16:35:12,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:12,703 INFO  L482      AbstractCegarLoop]: Abstraction has 273 states and 560 transitions.
[2021-06-01 16:35:12,703 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,703 INFO  L276                IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions.
[2021-06-01 16:35:12,703 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2021-06-01 16:35:12,704 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:12,704 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]
[2021-06-01 16:35:12,704 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 16:35:12,704 INFO  L430      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:12,704 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:12,704 INFO  L82        PathProgramCache]: Analyzing trace with hash -1463907637, now seen corresponding path program 1 times
[2021-06-01 16:35:12,705 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:12,705 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929914763]
[2021-06-01 16:35:12,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:12,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:35:12,734 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:35:12,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:35:12,765 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:35:12,793 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 16:35:12,793 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 16:35:12,794 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 16:35:12,794 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3)
[2021-06-01 16:35:12,795 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:35:12,796 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:12,796 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:12,796 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:12,796 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:12,796 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:12,796 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:12,796 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:12,796 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork1========
[2021-06-01 16:35:12,798 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow
[2021-06-01 16:35:12,852 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,856 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2021-06-01 16:35:12,856 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:35:12,856 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]
[2021-06-01 16:35:12,856 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:12,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:12,857 INFO  L82        PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times
[2021-06-01 16:35:12,857 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:12,857 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613345061]
[2021-06-01 16:35:12,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:12,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:12,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:12,877 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:12,877 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613345061]
[2021-06-01 16:35:12,878 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613345061] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:12,878 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:12,878 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 16:35:12,878 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402925890]
[2021-06-01 16:35:12,878 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:35:12,878 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:12,879 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:35:12,879 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:35:12,882 INFO  L87              Difference]: Start difference. First operand  has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,917 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:12,918 INFO  L93              Difference]: Finished difference Result 1627 states and 4300 transitions.
[2021-06-01 16:35:12,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-01 16:35:12,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37
[2021-06-01 16:35:12,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:12,919 INFO  L225             Difference]: With dead ends: 1627
[2021-06-01 16:35:12,919 INFO  L226             Difference]: Without dead ends: 0
[2021-06-01 16:35:12,919 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:35:12,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 16:35:12,919 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 16:35:12,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 16:35:12,920 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37
[2021-06-01 16:35:12,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:12,920 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 16:35:12,920 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:12,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 16:35:12,920 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:35:12,920 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 16:35:12,920 INFO  L301   ceAbstractionStarter]: Result for error location P0Thread1of1ForFork1 was SAFE (3/3)
[2021-06-01 16:35:12,921 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 16:35:13,007 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:35:13 BasicIcfg
[2021-06-01 16:35:13,008 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 16:35:13,008 INFO  L168              Benchmark]: Toolchain (without parser) took 8734.68 ms. Allocated memory was 333.4 MB in the beginning and 530.6 MB in the end (delta: 197.1 MB). Free memory was 295.6 MB in the beginning and 468.2 MB in the end (delta: -172.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,008 INFO  L168              Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 333.4 MB. Free memory is still 313.8 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,009 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 504.62 ms. Allocated memory is still 333.4 MB. Free memory was 295.4 MB in the beginning and 292.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,009 INFO  L168              Benchmark]: Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 333.4 MB. Free memory was 292.8 MB in the beginning and 290.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,009 INFO  L168              Benchmark]: Boogie Preprocessor took 34.60 ms. Allocated memory is still 333.4 MB. Free memory was 290.3 MB in the beginning and 288.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,009 INFO  L168              Benchmark]: RCFGBuilder took 1587.12 ms. Allocated memory was 333.4 MB in the beginning and 400.6 MB in the end (delta: 67.1 MB). Free memory was 288.3 MB in the beginning and 365.8 MB in the end (delta: -77.5 MB). Peak memory consumption was 101.6 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,018 INFO  L168              Benchmark]: TraceAbstraction took 6547.86 ms. Allocated memory was 400.6 MB in the beginning and 530.6 MB in the end (delta: 130.0 MB). Free memory was 364.8 MB in the beginning and 468.2 MB in the end (delta: -103.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:13,019 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.15 ms. Allocated memory is still 333.4 MB. Free memory is still 313.8 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 504.62 ms. Allocated memory is still 333.4 MB. Free memory was 295.4 MB in the beginning and 292.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 333.4 MB. Free memory was 292.8 MB in the beginning and 290.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 34.60 ms. Allocated memory is still 333.4 MB. Free memory was 290.3 MB in the beginning and 288.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 1587.12 ms. Allocated memory was 333.4 MB in the beginning and 400.6 MB in the end (delta: 67.1 MB). Free memory was 288.3 MB in the beginning and 365.8 MB in the end (delta: -77.5 MB). Peak memory consumption was 101.6 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 6547.86 ms. Allocated memory was 400.6 MB in the beginning and 530.6 MB in the end (delta: 130.0 MB). Free memory was 364.8 MB in the beginning and 468.2 MB in the end (delta: -103.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 18]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L708]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L709]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0]
[L710]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L712]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L714]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L715]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L716]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L717]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=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]
[L718]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=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]
[L719]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=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]
[L720]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0]
[L721]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0]
[L722]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L723]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0]
[L724]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L725]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L726]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L727]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L728]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L729]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L730]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L790]               0  pthread_t t2473;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L791]  FCALL, FORK  0  pthread_create(&t2473, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L792]               0  pthread_t t2474;
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L793]  FCALL, FORK  0  pthread_create(&t2474, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L734]               1  y$w_buff1 = y$w_buff0
[L735]               1  y$w_buff0 = 2
[L736]               1  y$w_buff1_used = y$w_buff0_used
[L737]               1  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L739]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L740]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L741]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L742]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L745]               1  x = 1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L762]               2  x = 2
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L765]               2  y = 1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L748]  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)
[L748]               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)
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]               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
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L752]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L752]               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
[L755]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L768]  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)
[L768]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L768]  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)
[L768]               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)
[L769]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L769]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L770]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L770]               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
[L771]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L771]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L772]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L772]               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
[L775]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L795]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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]
[L799]  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)
[L799]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L799]  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)
[L799]               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)
[L800]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L800]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L801]               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
[L802]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L802]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L803]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L803]               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
[L806]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               0  y$flush_delayed = weak$$choice2
[L809]               0  y$mem_tmp = y
[L810]  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)
[L810]               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)
[L811]  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))
[L811]               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))
[L812]  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))
[L812]               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))
[L813]  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))
[L813]               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))
[L814]  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))
[L814]               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))
[L815]  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))
[L815]               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))
[L816]  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))
[L816]               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))
[L817]               0  main$tmp_guard1 = !(x == 2 && y == 2)
[L818]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L818]               0  y = y$flush_delayed ? y$mem_tmp : y
[L819]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L18]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L18]                0  reach_error()
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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: P0 with 1 thread instances
    CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 114.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 26.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 84.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
    CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6112.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 29.6ms, AutomataDifference: 3089.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 48.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1133 SDtfs, 2149 SDslu, 5071 SDs, 0 SdLazy, 1091 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1050.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 2368.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 281.1ms AutomataMinimizationTime, 11 MinimizatonAttempts, 430 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.7ms SsaConstructionTime, 508.6ms SatisfiabilityAnalysisTime, 1842.6ms InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 3901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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: P0Thread1of1ForFork1 with 1 thread instances
    CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 124.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 3.8ms, AutomataDifference: 40.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 55.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 34 SDslu, 61 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7ms SsaConstructionTime, 2.4ms SatisfiabilityAnalysisTime, 12.1ms InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...