/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 12:07:42,634 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 12:07:42,637 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 12:07:42,660 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 12:07:42,660 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 12:07:42,661 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 12:07:42,663 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 12:07:42,665 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 12:07:42,666 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 12:07:42,667 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 12:07:42,668 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 12:07:42,669 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 12:07:42,670 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 12:07:42,671 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 12:07:42,672 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 12:07:42,673 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 12:07:42,674 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 12:07:42,674 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 12:07:42,676 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 12:07:42,678 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 12:07:42,679 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 12:07:42,680 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 12:07:42,681 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 12:07:42,682 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 12:07:42,685 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 12:07:42,685 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 12:07:42,685 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 12:07:42,686 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 12:07:42,686 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 12:07:42,687 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 12:07:42,687 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 12:07:42,688 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 12:07:42,689 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 12:07:42,693 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 12:07:42,694 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 12:07:42,694 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 12:07:42,694 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 12:07:42,694 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 12:07:42,695 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 12:07:42,695 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 12:07:42,696 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 12:07:42,697 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf
[2020-10-16 12:07:42,740 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 12:07:42,741 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 12:07:42,744 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 12:07:42,744 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 12:07:42,744 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 12:07:42,744 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 12:07:42,744 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 12:07:42,745 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 12:07:42,745 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 12:07:42,745 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 12:07:42,746 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 12:07:42,746 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 12:07:42,746 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 12:07:42,747 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 12:07:42,747 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 12:07:42,747 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 12:07:42,748 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 12:07:42,748 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 12:07:42,748 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 12:07:42,748 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 12:07:42,748 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 12:07:42,749 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:07:42,749 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 12:07:42,749 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 12:07:42,749 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 12:07:42,750 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 12:07:42,750 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 12:07:42,750 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 12:07:42,750 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:07:43,045 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:07:43,058 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:07:43,062 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:07:43,064 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:07:43,064 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:07:43,065 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i
[2020-10-16 12:07:43,146 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cccfe90a/399ca13dd73f4b6e86098567502f8960/FLAG63e24ab5a
[2020-10-16 12:07:43,723 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:07:43,724 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i
[2020-10-16 12:07:43,738 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cccfe90a/399ca13dd73f4b6e86098567502f8960/FLAG63e24ab5a
[2020-10-16 12:07:43,997 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cccfe90a/399ca13dd73f4b6e86098567502f8960
[2020-10-16 12:07:44,006 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:07:44,008 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:07:44,009 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:07:44,009 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:07:44,013 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:07:44,017 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:43" (1/1) ...
[2020-10-16 12:07:44,022 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bcd645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44, skipping insertion in model container
[2020-10-16 12:07:44,022 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:43" (1/1) ...
[2020-10-16 12:07:44,032 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:07:44,108 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:07:44,592 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:07:44,611 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:07:44,746 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:07:44,820 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:07:44,821 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44 WrapperNode
[2020-10-16 12:07:44,821 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:07:44,822 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:07:44,822 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:07:44,822 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:07:44,831 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,852 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,895 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:07:44,895 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:07:44,895 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:07:44,896 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:07:44,904 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,905 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,910 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,910 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,921 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,925 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,929 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
[2020-10-16 12:07:44,934 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:07:44,935 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:07:44,935 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:07:44,935 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:07:44,936 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:07:45,017 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:07:45,018 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:07:45,018 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:07:45,018 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:07:45,018 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:07:45,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:07:45,019 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:07:45,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:07:45,019 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:07:45,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:07:45,019 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:07:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:07:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:07:45,022 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 12:07:47,087 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:07:47,087 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:07:47,090 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:47 BoogieIcfgContainer
[2020-10-16 12:07:47,090 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:07:47,092 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:07:47,092 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:07:47,096 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:07:47,097 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:07:43" (1/3) ...
[2020-10-16 12:07:47,097 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33267baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:47, skipping insertion in model container
[2020-10-16 12:07:47,098 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:44" (2/3) ...
[2020-10-16 12:07:47,098 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33267baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:47, skipping insertion in model container
[2020-10-16 12:07:47,098 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:47" (3/3) ...
[2020-10-16 12:07:47,100 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i
[2020-10-16 12:07:47,115 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:07:47,115 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:07:47,125 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:07:47,126 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:07:47,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,157 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,158 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,158 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,159 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,160 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,160 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,161 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,161 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,162 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,162 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,162 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,162 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,163 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,163 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,164 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,165 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,166 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,166 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,166 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,166 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,167 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,168 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,169 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,173 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,173 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,173 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,173 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,180 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,180 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,180 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,180 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,180 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,182 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,182 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,182 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:07:47,185 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:07:47,199 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 12:07:47,221 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:07:47,221 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:07:47,221 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:07:47,221 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 12:07:47,221 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:07:47,222 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:07:47,222 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:07:47,222 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:07:47,236 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:07:47,236 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:07:47,240 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:07:47,243 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 12:07:47,289 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 12:07:47,289 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:07:47,295 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. 
[2020-10-16 12:07:47,298 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1642
[2020-10-16 12:07:48,783 WARN  L193               SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-16 12:07:48,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-16 12:07:48,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:07:48,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 12:07:48,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:07:49,981 WARN  L193               SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 145 DAG size of output: 124
[2020-10-16 12:07:50,869 WARN  L193               SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-16 12:07:50,986 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 12:07:51,547 WARN  L193               SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 12:07:51,924 WARN  L193               SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 12:07:52,519 WARN  L193               SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110
[2020-10-16 12:07:52,871 WARN  L193               SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-10-16 12:07:54,088 WARN  L193               SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130
[2020-10-16 12:07:54,428 WARN  L193               SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 127
[2020-10-16 12:07:54,976 WARN  L193               SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-10-16 12:07:55,402 WARN  L193               SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-10-16 12:07:55,636 WARN  L193               SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85
[2020-10-16 12:07:55,751 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 12:07:55,775 INFO  L132        LiptonReduction]: Checked pairs total: 4586
[2020-10-16 12:07:55,775 INFO  L134        LiptonReduction]: Total number of compositions: 77
[2020-10-16 12:07:55,782 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow
[2020-10-16 12:07:55,862 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states.
[2020-10-16 12:07:55,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 822 states.
[2020-10-16 12:07:55,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 12:07:55,871 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:55,871 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 12:07:55,872 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:55,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:55,878 INFO  L82        PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times
[2020-10-16 12:07:55,886 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:55,887 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927409629]
[2020-10-16 12:07:55,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:56,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:56,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:56,117 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927409629]
[2020-10-16 12:07:56,118 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:56,118 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:07:56,119 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485064751]
[2020-10-16 12:07:56,124 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:07:56,124 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:56,145 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:07:56,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,150 INFO  L87              Difference]: Start difference. First operand 822 states. Second operand 3 states.
[2020-10-16 12:07:56,307 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:56,308 INFO  L93              Difference]: Finished difference Result 687 states and 2150 transitions.
[2020-10-16 12:07:56,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:07:56,312 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 12:07:56,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:56,344 INFO  L225             Difference]: With dead ends: 687
[2020-10-16 12:07:56,345 INFO  L226             Difference]: Without dead ends: 562
[2020-10-16 12:07:56,349 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,378 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 562 states.
[2020-10-16 12:07:56,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562.
[2020-10-16 12:07:56,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 562 states.
[2020-10-16 12:07:56,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions.
[2020-10-16 12:07:56,472 INFO  L78                 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5
[2020-10-16 12:07:56,472 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:56,473 INFO  L481      AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions.
[2020-10-16 12:07:56,473 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:07:56,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions.
[2020-10-16 12:07:56,475 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 12:07:56,475 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:56,475 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:56,475 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:07:56,476 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:56,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:56,476 INFO  L82        PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times
[2020-10-16 12:07:56,476 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:56,478 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489168245]
[2020-10-16 12:07:56,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:56,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:56,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:56,598 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489168245]
[2020-10-16 12:07:56,598 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:56,599 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:07:56,599 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510213366]
[2020-10-16 12:07:56,600 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:07:56,601 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:56,601 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:07:56,601 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,601 INFO  L87              Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states.
[2020-10-16 12:07:56,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:56,647 INFO  L93              Difference]: Finished difference Result 557 states and 1706 transitions.
[2020-10-16 12:07:56,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:07:56,648 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 12:07:56,648 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:56,652 INFO  L225             Difference]: With dead ends: 557
[2020-10-16 12:07:56,653 INFO  L226             Difference]: Without dead ends: 557
[2020-10-16 12:07:56,654 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 557 states.
[2020-10-16 12:07:56,668 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557.
[2020-10-16 12:07:56,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 557 states.
[2020-10-16 12:07:56,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions.
[2020-10-16 12:07:56,672 INFO  L78                 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9
[2020-10-16 12:07:56,673 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:56,708 INFO  L481      AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions.
[2020-10-16 12:07:56,708 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:07:56,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions.
[2020-10-16 12:07:56,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 12:07:56,711 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:56,711 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:56,712 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:07:56,712 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:56,712 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:56,712 INFO  L82        PathProgramCache]: Analyzing trace with hash 1993949950, now seen corresponding path program 1 times
[2020-10-16 12:07:56,713 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:56,713 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069010105]
[2020-10-16 12:07:56,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:56,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:56,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:56,874 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069010105]
[2020-10-16 12:07:56,875 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:56,875 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:07:56,875 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392351554]
[2020-10-16 12:07:56,875 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:07:56,876 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:56,876 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:07:56,876 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,876 INFO  L87              Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states.
[2020-10-16 12:07:56,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:56,903 INFO  L93              Difference]: Finished difference Result 533 states and 1620 transitions.
[2020-10-16 12:07:56,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:07:56,904 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 12:07:56,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:56,909 INFO  L225             Difference]: With dead ends: 533
[2020-10-16 12:07:56,909 INFO  L226             Difference]: Without dead ends: 533
[2020-10-16 12:07:56,909 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:56,912 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 533 states.
[2020-10-16 12:07:56,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533.
[2020-10-16 12:07:56,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 533 states.
[2020-10-16 12:07:56,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions.
[2020-10-16 12:07:56,926 INFO  L78                 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10
[2020-10-16 12:07:56,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:56,927 INFO  L481      AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions.
[2020-10-16 12:07:56,927 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:07:56,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions.
[2020-10-16 12:07:56,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:07:56,929 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:56,930 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:56,930 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:07:56,930 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:56,930 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:56,930 INFO  L82        PathProgramCache]: Analyzing trace with hash 1682906291, now seen corresponding path program 1 times
[2020-10-16 12:07:56,931 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:56,931 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803676978]
[2020-10-16 12:07:56,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:56,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:56,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:56,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803676978]
[2020-10-16 12:07:56,992 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:56,992 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:07:56,993 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951698885]
[2020-10-16 12:07:56,993 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:56,993 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:56,994 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:56,994 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:56,996 INFO  L87              Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 4 states.
[2020-10-16 12:07:57,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,054 INFO  L93              Difference]: Finished difference Result 1181 states and 3498 transitions.
[2020-10-16 12:07:57,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:07:57,056 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 12:07:57,056 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,064 INFO  L225             Difference]: With dead ends: 1181
[2020-10-16 12:07:57,064 INFO  L226             Difference]: Without dead ends: 737
[2020-10-16 12:07:57,064 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:57,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 737 states.
[2020-10-16 12:07:57,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 533.
[2020-10-16 12:07:57,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 533 states.
[2020-10-16 12:07:57,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1581 transitions.
[2020-10-16 12:07:57,085 INFO  L78                 Accepts]: Start accepts. Automaton has 533 states and 1581 transitions. Word has length 11
[2020-10-16 12:07:57,085 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,086 INFO  L481      AbstractCegarLoop]: Abstraction has 533 states and 1581 transitions.
[2020-10-16 12:07:57,086 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:57,086 INFO  L276                IsEmpty]: Start isEmpty. Operand 533 states and 1581 transitions.
[2020-10-16 12:07:57,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:07:57,090 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,090 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,090 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:07:57,090 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,091 INFO  L82        PathProgramCache]: Analyzing trace with hash 2108923477, now seen corresponding path program 1 times
[2020-10-16 12:07:57,091 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,091 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550423792]
[2020-10-16 12:07:57,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,160 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550423792]
[2020-10-16 12:07:57,160 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,161 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:07:57,161 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250311249]
[2020-10-16 12:07:57,161 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:07:57,162 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,162 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:07:57,162 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:57,162 INFO  L87              Difference]: Start difference. First operand 533 states and 1581 transitions. Second operand 3 states.
[2020-10-16 12:07:57,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,180 INFO  L93              Difference]: Finished difference Result 529 states and 1566 transitions.
[2020-10-16 12:07:57,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:07:57,181 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 12:07:57,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,185 INFO  L225             Difference]: With dead ends: 529
[2020-10-16 12:07:57,186 INFO  L226             Difference]: Without dead ends: 529
[2020-10-16 12:07:57,186 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:57,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 529 states.
[2020-10-16 12:07:57,200 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529.
[2020-10-16 12:07:57,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 529 states.
[2020-10-16 12:07:57,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1566 transitions.
[2020-10-16 12:07:57,203 INFO  L78                 Accepts]: Start accepts. Automaton has 529 states and 1566 transitions. Word has length 11
[2020-10-16 12:07:57,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,203 INFO  L481      AbstractCegarLoop]: Abstraction has 529 states and 1566 transitions.
[2020-10-16 12:07:57,203 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:07:57,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 529 states and 1566 transitions.
[2020-10-16 12:07:57,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:07:57,205 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,205 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,205 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:07:57,205 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,206 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,206 INFO  L82        PathProgramCache]: Analyzing trace with hash 1055844487, now seen corresponding path program 2 times
[2020-10-16 12:07:57,206 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,206 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226372150]
[2020-10-16 12:07:57,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,285 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226372150]
[2020-10-16 12:07:57,285 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,286 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:07:57,286 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015449748]
[2020-10-16 12:07:57,286 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:57,286 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,287 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:57,287 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:57,287 INFO  L87              Difference]: Start difference. First operand 529 states and 1566 transitions. Second operand 4 states.
[2020-10-16 12:07:57,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,381 INFO  L93              Difference]: Finished difference Result 513 states and 1510 transitions.
[2020-10-16 12:07:57,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:07:57,382 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 12:07:57,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,386 INFO  L225             Difference]: With dead ends: 513
[2020-10-16 12:07:57,386 INFO  L226             Difference]: Without dead ends: 513
[2020-10-16 12:07:57,386 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:57,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 513 states.
[2020-10-16 12:07:57,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513.
[2020-10-16 12:07:57,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 513 states.
[2020-10-16 12:07:57,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1510 transitions.
[2020-10-16 12:07:57,402 INFO  L78                 Accepts]: Start accepts. Automaton has 513 states and 1510 transitions. Word has length 11
[2020-10-16 12:07:57,402 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,402 INFO  L481      AbstractCegarLoop]: Abstraction has 513 states and 1510 transitions.
[2020-10-16 12:07:57,402 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:57,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 513 states and 1510 transitions.
[2020-10-16 12:07:57,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 12:07:57,403 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,404 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,404 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:07:57,404 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,404 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,404 INFO  L82        PathProgramCache]: Analyzing trace with hash 516480695, now seen corresponding path program 1 times
[2020-10-16 12:07:57,405 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,405 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050332443]
[2020-10-16 12:07:57,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,463 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050332443]
[2020-10-16 12:07:57,464 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,464 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:07:57,464 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921123805]
[2020-10-16 12:07:57,465 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:57,465 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,465 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:57,465 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:57,466 INFO  L87              Difference]: Start difference. First operand 513 states and 1510 transitions. Second operand 4 states.
[2020-10-16 12:07:57,540 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,541 INFO  L93              Difference]: Finished difference Result 494 states and 1443 transitions.
[2020-10-16 12:07:57,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:07:57,542 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 12:07:57,542 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,546 INFO  L225             Difference]: With dead ends: 494
[2020-10-16 12:07:57,546 INFO  L226             Difference]: Without dead ends: 494
[2020-10-16 12:07:57,546 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:57,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 494 states.
[2020-10-16 12:07:57,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494.
[2020-10-16 12:07:57,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 494 states.
[2020-10-16 12:07:57,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1443 transitions.
[2020-10-16 12:07:57,561 INFO  L78                 Accepts]: Start accepts. Automaton has 494 states and 1443 transitions. Word has length 12
[2020-10-16 12:07:57,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,562 INFO  L481      AbstractCegarLoop]: Abstraction has 494 states and 1443 transitions.
[2020-10-16 12:07:57,562 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:57,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 494 states and 1443 transitions.
[2020-10-16 12:07:57,563 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:07:57,563 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,563 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,563 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:07:57,563 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,564 INFO  L82        PathProgramCache]: Analyzing trace with hash -1168968894, now seen corresponding path program 1 times
[2020-10-16 12:07:57,564 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,564 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843724047]
[2020-10-16 12:07:57,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,606 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843724047]
[2020-10-16 12:07:57,607 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,607 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:07:57,607 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004693855]
[2020-10-16 12:07:57,607 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:07:57,608 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,608 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:07:57,608 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:57,608 INFO  L87              Difference]: Start difference. First operand 494 states and 1443 transitions. Second operand 3 states.
[2020-10-16 12:07:57,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,629 INFO  L93              Difference]: Finished difference Result 665 states and 1896 transitions.
[2020-10-16 12:07:57,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:07:57,630 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 12:07:57,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,633 INFO  L225             Difference]: With dead ends: 665
[2020-10-16 12:07:57,634 INFO  L226             Difference]: Without dead ends: 413
[2020-10-16 12:07:57,634 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:07:57,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2020-10-16 12:07:57,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 377.
[2020-10-16 12:07:57,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 377 states.
[2020-10-16 12:07:57,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1068 transitions.
[2020-10-16 12:07:57,646 INFO  L78                 Accepts]: Start accepts. Automaton has 377 states and 1068 transitions. Word has length 13
[2020-10-16 12:07:57,647 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,647 INFO  L481      AbstractCegarLoop]: Abstraction has 377 states and 1068 transitions.
[2020-10-16 12:07:57,647 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:07:57,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 377 states and 1068 transitions.
[2020-10-16 12:07:57,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:07:57,648 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,648 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,648 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:07:57,648 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,649 INFO  L82        PathProgramCache]: Analyzing trace with hash -549128060, now seen corresponding path program 1 times
[2020-10-16 12:07:57,649 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,650 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759985990]
[2020-10-16 12:07:57,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,694 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759985990]
[2020-10-16 12:07:57,694 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,694 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:07:57,695 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626249415]
[2020-10-16 12:07:57,695 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:57,695 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,696 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:57,696 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:57,696 INFO  L87              Difference]: Start difference. First operand 377 states and 1068 transitions. Second operand 4 states.
[2020-10-16 12:07:57,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,726 INFO  L93              Difference]: Finished difference Result 545 states and 1546 transitions.
[2020-10-16 12:07:57,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:07:57,727 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 12:07:57,728 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,729 INFO  L225             Difference]: With dead ends: 545
[2020-10-16 12:07:57,729 INFO  L226             Difference]: Without dead ends: 245
[2020-10-16 12:07:57,730 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:57,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2020-10-16 12:07:57,736 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245.
[2020-10-16 12:07:57,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2020-10-16 12:07:57,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 683 transitions.
[2020-10-16 12:07:57,738 INFO  L78                 Accepts]: Start accepts. Automaton has 245 states and 683 transitions. Word has length 13
[2020-10-16 12:07:57,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,738 INFO  L481      AbstractCegarLoop]: Abstraction has 245 states and 683 transitions.
[2020-10-16 12:07:57,738 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:57,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 245 states and 683 transitions.
[2020-10-16 12:07:57,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:07:57,739 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,739 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,740 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:07:57,740 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,740 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,740 INFO  L82        PathProgramCache]: Analyzing trace with hash -1878284186, now seen corresponding path program 1 times
[2020-10-16 12:07:57,740 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,741 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528564845]
[2020-10-16 12:07:57,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,800 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528564845]
[2020-10-16 12:07:57,800 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,800 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:07:57,801 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280171600]
[2020-10-16 12:07:57,801 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:07:57,801 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,802 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:07:57,802 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:57,802 INFO  L87              Difference]: Start difference. First operand 245 states and 683 transitions. Second operand 5 states.
[2020-10-16 12:07:57,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:57,847 INFO  L93              Difference]: Finished difference Result 353 states and 980 transitions.
[2020-10-16 12:07:57,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:07:57,848 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 12:07:57,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:57,850 INFO  L225             Difference]: With dead ends: 353
[2020-10-16 12:07:57,850 INFO  L226             Difference]: Without dead ends: 209
[2020-10-16 12:07:57,850 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:07:57,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2020-10-16 12:07:57,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2020-10-16 12:07:57,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 209 states.
[2020-10-16 12:07:57,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 563 transitions.
[2020-10-16 12:07:57,857 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 563 transitions. Word has length 14
[2020-10-16 12:07:57,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:57,857 INFO  L481      AbstractCegarLoop]: Abstraction has 209 states and 563 transitions.
[2020-10-16 12:07:57,857 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:07:57,857 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 563 transitions.
[2020-10-16 12:07:57,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:07:57,858 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:57,858 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:57,858 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:07:57,859 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:57,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:57,859 INFO  L82        PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 2 times
[2020-10-16 12:07:57,859 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:57,860 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219180250]
[2020-10-16 12:07:57,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:57,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:57,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:57,936 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219180250]
[2020-10-16 12:07:57,936 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:57,937 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:07:57,937 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845524025]
[2020-10-16 12:07:57,937 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:57,937 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:57,937 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:57,938 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:57,938 INFO  L87              Difference]: Start difference. First operand 209 states and 563 transitions. Second operand 4 states.
[2020-10-16 12:07:58,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:58,015 INFO  L93              Difference]: Finished difference Result 208 states and 559 transitions.
[2020-10-16 12:07:58,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:07:58,016 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 12:07:58,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:58,018 INFO  L225             Difference]: With dead ends: 208
[2020-10-16 12:07:58,019 INFO  L226             Difference]: Without dead ends: 208
[2020-10-16 12:07:58,020 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:58,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2020-10-16 12:07:58,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208.
[2020-10-16 12:07:58,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 208 states.
[2020-10-16 12:07:58,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions.
[2020-10-16 12:07:58,026 INFO  L78                 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14
[2020-10-16 12:07:58,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:58,027 INFO  L481      AbstractCegarLoop]: Abstraction has 208 states and 559 transitions.
[2020-10-16 12:07:58,027 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:58,027 INFO  L276                IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions.
[2020-10-16 12:07:58,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:07:58,028 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:58,028 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:58,028 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:07:58,028 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:58,028 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:58,029 INFO  L82        PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times
[2020-10-16 12:07:58,029 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:58,029 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098416969]
[2020-10-16 12:07:58,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:58,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:58,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:58,155 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098416969]
[2020-10-16 12:07:58,155 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:58,155 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:07:58,156 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148529518]
[2020-10-16 12:07:58,156 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:07:58,156 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:58,156 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:07:58,156 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:07:58,157 INFO  L87              Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 4 states.
[2020-10-16 12:07:58,198 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:58,198 INFO  L93              Difference]: Finished difference Result 206 states and 485 transitions.
[2020-10-16 12:07:58,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:07:58,199 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 12:07:58,199 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:58,200 INFO  L225             Difference]: With dead ends: 206
[2020-10-16 12:07:58,200 INFO  L226             Difference]: Without dead ends: 153
[2020-10-16 12:07:58,201 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:58,203 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2020-10-16 12:07:58,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153.
[2020-10-16 12:07:58,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2020-10-16 12:07:58,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions.
[2020-10-16 12:07:58,208 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 15
[2020-10-16 12:07:58,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:58,208 INFO  L481      AbstractCegarLoop]: Abstraction has 153 states and 355 transitions.
[2020-10-16 12:07:58,208 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:07:58,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions.
[2020-10-16 12:07:58,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:07:58,209 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:58,209 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:58,209 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 12:07:58,209 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:58,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:58,210 INFO  L82        PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times
[2020-10-16 12:07:58,213 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:58,213 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570352032]
[2020-10-16 12:07:58,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:58,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:58,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:58,313 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570352032]
[2020-10-16 12:07:58,313 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:58,313 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:07:58,314 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373192648]
[2020-10-16 12:07:58,314 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:07:58,314 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:58,314 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:07:58,315 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:07:58,315 INFO  L87              Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states.
[2020-10-16 12:07:58,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:58,375 INFO  L93              Difference]: Finished difference Result 124 states and 251 transitions.
[2020-10-16 12:07:58,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:07:58,376 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 12:07:58,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:58,377 INFO  L225             Difference]: With dead ends: 124
[2020-10-16 12:07:58,377 INFO  L226             Difference]: Without dead ends: 93
[2020-10-16 12:07:58,377 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:07:58,378 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2020-10-16 12:07:58,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2020-10-16 12:07:58,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-10-16 12:07:58,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions.
[2020-10-16 12:07:58,381 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 16
[2020-10-16 12:07:58,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:58,382 INFO  L481      AbstractCegarLoop]: Abstraction has 93 states and 179 transitions.
[2020-10-16 12:07:58,382 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:07:58,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions.
[2020-10-16 12:07:58,383 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:07:58,383 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:58,383 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:58,383 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 12:07:58,383 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:58,384 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:58,384 INFO  L82        PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times
[2020-10-16 12:07:58,384 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:58,385 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481066532]
[2020-10-16 12:07:58,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:58,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:58,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:58,546 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481066532]
[2020-10-16 12:07:58,546 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:58,546 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:07:58,546 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37952592]
[2020-10-16 12:07:58,547 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:07:58,547 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:58,547 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:07:58,547 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:07:58,547 INFO  L87              Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 6 states.
[2020-10-16 12:07:58,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:58,601 INFO  L93              Difference]: Finished difference Result 79 states and 149 transitions.
[2020-10-16 12:07:58,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:07:58,602 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-16 12:07:58,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:58,603 INFO  L225             Difference]: With dead ends: 79
[2020-10-16 12:07:58,603 INFO  L226             Difference]: Without dead ends: 70
[2020-10-16 12:07:58,603 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:07:58,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2020-10-16 12:07:58,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2020-10-16 12:07:58,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2020-10-16 12:07:58,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions.
[2020-10-16 12:07:58,606 INFO  L78                 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18
[2020-10-16 12:07:58,606 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:58,606 INFO  L481      AbstractCegarLoop]: Abstraction has 70 states and 133 transitions.
[2020-10-16 12:07:58,606 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:07:58,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions.
[2020-10-16 12:07:58,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 12:07:58,607 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:58,607 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:58,607 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 12:07:58,607 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:58,608 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:58,608 INFO  L82        PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times
[2020-10-16 12:07:58,608 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:58,608 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106414272]
[2020-10-16 12:07:58,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:58,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:07:58,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:07:58,766 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106414272]
[2020-10-16 12:07:58,766 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:07:58,766 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:07:58,767 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080771067]
[2020-10-16 12:07:58,767 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:07:58,767 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:07:58,767 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:07:58,768 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:07:58,768 INFO  L87              Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 7 states.
[2020-10-16 12:07:58,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:07:58,852 INFO  L93              Difference]: Finished difference Result 90 states and 168 transitions.
[2020-10-16 12:07:58,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:07:58,853 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 21
[2020-10-16 12:07:58,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:07:58,853 INFO  L225             Difference]: With dead ends: 90
[2020-10-16 12:07:58,853 INFO  L226             Difference]: Without dead ends: 50
[2020-10-16 12:07:58,854 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:07:58,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2020-10-16 12:07:58,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2020-10-16 12:07:58,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2020-10-16 12:07:58,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions.
[2020-10-16 12:07:58,856 INFO  L78                 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21
[2020-10-16 12:07:58,856 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:07:58,856 INFO  L481      AbstractCegarLoop]: Abstraction has 50 states and 85 transitions.
[2020-10-16 12:07:58,856 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:07:58,856 INFO  L276                IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions.
[2020-10-16 12:07:58,857 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 12:07:58,857 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:07:58,857 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:07:58,857 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 12:07:58,857 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:07:58,858 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:07:58,858 INFO  L82        PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times
[2020-10-16 12:07:58,858 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:07:58,858 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008163062]
[2020-10-16 12:07:58,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:07:58,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:07:58,901 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:07:58,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:07:58,940 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:07:58,977 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:07:58,978 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:07:58,978 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 12:07:58,979 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 12:07:58,990 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse6 (= (mod ~x$r_buff1_thd0~0_In-1837224926 256) 0)) (.cse7 (= 0 (mod ~x$w_buff1_used~0_In-1837224926 256))) (.cse9 (= (mod ~x$w_buff0_used~0_In-1837224926 256) 0)) (.cse8 (= 0 (mod ~x$r_buff0_thd0~0_In-1837224926 256)))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_In-1837224926 ~x$r_buff1_thd0~0_Out-1837224926) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-1837224926 0)) (and .cse2 (= ~x$w_buff0_used~0_In-1837224926 ~x$w_buff0_used~0_Out-1837224926))) (= ~x$r_buff0_thd0~0_Out-1837224926 ~x$r_buff0_thd0~0_In-1837224926) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1837224926 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1837224926| ULTIMATE.start_assume_abort_if_not_~cond_Out-1837224926) (or (and (= ~x$w_buff1_used~0_Out-1837224926 0) .cse3 .cse4) (and (= ~x$w_buff1_used~0_Out-1837224926 ~x$w_buff1_used~0_In-1837224926) .cse5)) (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-1837224926 ~x~0_Out-1837224926)) (and .cse2 (or (and (= ~x~0_Out-1837224926 ~x$w_buff1~0_In-1837224926) .cse3 .cse4) (and (= ~x~0_Out-1837224926 ~x~0_In-1837224926) .cse5)))))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In-1837224926, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1837224926, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1837224926|, ~x$w_buff1~0=~x$w_buff1~0_In-1837224926, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837224926, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1837224926, ~x~0=~x~0_In-1837224926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837224926}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1837224926, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1837224926, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1837224926|, ~x$w_buff1~0=~x$w_buff1~0_In-1837224926, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1837224926|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1837224926, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1837224926|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1837224926|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1837224926|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1837224926, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1837224926, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1837224926|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1837224926|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1837224926, ~x~0=~x~0_Out-1837224926}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-16 12:07:58,995 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,996 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,998 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,998 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,998 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,999 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,999 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:58,999 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:58,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,000 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,000 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,000 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,000 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,001 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,001 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,001 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,002 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,002 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,002 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,002 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,003 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,003 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,003 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,003 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,003 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,003 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,004 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,004 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,004 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,005 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,005 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,005 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,005 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,005 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,006 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,006 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,006 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,006 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,006 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,006 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,007 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,007 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,007 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,007 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,007 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,007 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,008 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,008 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,008 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,008 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,008 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,008 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,009 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,009 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,009 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 12:07:59,009 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:07:59,062 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:07:59 BasicIcfg
[2020-10-16 12:07:59,062 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:07:59,064 INFO  L168              Benchmark]: Toolchain (without parser) took 15057.15 ms. Allocated memory was 145.2 MB in the beginning and 358.1 MB in the end (delta: 212.9 MB). Free memory was 97.9 MB in the beginning and 220.6 MB in the end (delta: -122.7 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,065 INFO  L168              Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.2 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,065 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 812.70 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 97.7 MB in the beginning and 153.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,066 INFO  L168              Benchmark]: Boogie Procedure Inliner took 73.12 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,067 INFO  L168              Benchmark]: Boogie Preprocessor took 39.10 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,067 INFO  L168              Benchmark]: RCFGBuilder took 2155.67 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 148.2 MB in the beginning and 171.0 MB in the end (delta: -22.8 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,068 INFO  L168              Benchmark]: TraceAbstraction took 11970.85 ms. Allocated memory was 249.6 MB in the beginning and 358.1 MB in the end (delta: 108.5 MB). Free memory was 169.1 MB in the beginning and 220.6 MB in the end (delta: -51.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB.
[2020-10-16 12:07:59,072 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.27 ms. Allocated memory is still 145.2 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 812.70 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 97.7 MB in the beginning and 153.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 73.12 ms. Allocated memory is still 201.3 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 39.10 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2155.67 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 148.2 MB in the beginning and 171.0 MB in the end (delta: -22.8 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 11970.85 ms. Allocated memory was 249.6 MB in the beginning and 358.1 MB in the end (delta: 108.5 MB). Free memory was 169.1 MB in the beginning and 220.6 MB in the end (delta: -51.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    822 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4586 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L702]               0  int __unbuffered_p2_EBX = 0;
[L703]               0  _Bool main$tmp_guard0;
[L704]               0  _Bool main$tmp_guard1;
[L706]               0  int x = 0;
[L707]               0  _Bool x$flush_delayed;
[L708]               0  int x$mem_tmp;
[L709]               0  _Bool x$r_buff0_thd0;
[L710]               0  _Bool x$r_buff0_thd1;
[L711]               0  _Bool x$r_buff0_thd2;
[L712]               0  _Bool x$r_buff0_thd3;
[L713]               0  _Bool x$r_buff1_thd0;
[L714]               0  _Bool x$r_buff1_thd1;
[L715]               0  _Bool x$r_buff1_thd2;
[L716]               0  _Bool x$r_buff1_thd3;
[L717]               0  _Bool x$read_delayed;
[L718]               0  int *x$read_delayed_var;
[L719]               0  int x$w_buff0;
[L720]               0  _Bool x$w_buff0_used;
[L721]               0  int x$w_buff1;
[L722]               0  _Bool x$w_buff1_used;
[L724]               0  int y = 0;
[L725]               0  _Bool weak$$choice0;
[L726]               0  _Bool weak$$choice2;
[L807]               0  pthread_t t1882;
[L808]  FCALL, FORK  0  pthread_create(&t1882, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L809]               0  pthread_t t1883;
[L810]  FCALL, FORK  0  pthread_create(&t1883, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L811]               0  pthread_t t1884;
[L750]               2  x$w_buff1 = x$w_buff0
[L751]               2  x$w_buff0 = 2
[L752]               2  x$w_buff1_used = x$w_buff0_used
[L753]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L755]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L756]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L757]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L758]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L759]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L762]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L812]  FCALL, FORK  0  pthread_create(&t1884, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L779]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L782]               3  __unbuffered_p2_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L730]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L733]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L765]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L765]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L765]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L765]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L766]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L766]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L767]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L767]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L768]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L768]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L769]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L769]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L785]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L785]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L786]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L786]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L787]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L787]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L788]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L788]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L789]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L789]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L792]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L794]               3  return 0;
[L736]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L736]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L737]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L737]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L738]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L739]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L739]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L740]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L740]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L743]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L745]               1  return 0;
[L772]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L774]               2  return 0;
[L814]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L825]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L826]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L827]               0  x$flush_delayed = weak$$choice2
[L828]               0  x$mem_tmp = x
[L829]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L829]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L829]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L829]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L830]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L830]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L830]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L830]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L831]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L831]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L831]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1
[L831]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L831]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L831]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L832]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L832]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L832]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L832]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L832]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L832]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L833]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L833]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L834]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L834]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L835]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L835]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L836]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L837]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L837]               0  x = x$flush_delayed ? x$mem_tmp : x
[L838]               0  x$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 334 SDtfs, 296 SDslu, 400 SDs, 0 SdLazy, 257 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 240 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 15109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...