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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:59:59,526 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:59:59,530 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:59:59,583 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:59:59,583 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:59:59,596 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:59:59,597 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:59:59,600 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:59:59,603 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:59:59,607 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:59:59,608 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:59:59,610 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:59:59,610 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:59:59,613 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:59:59,616 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:59:59,617 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:59:59,619 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:59:59,620 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:59:59,622 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:59:59,626 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:59:59,628 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:59:59,629 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:59:59,631 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:59:59,632 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:59:59,636 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:59:59,636 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:59:59,636 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:59:59,639 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:59:59,640 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:59:59,641 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:59:59,641 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:59:59,644 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:59:59,644 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:59:59,645 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:59:59,646 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:59:59,646 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:59:59,647 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:59:59,647 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:59:59,647 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:59:59,648 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:59:59,650 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:59:59,651 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 11:59:59,696 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:59:59,696 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:59:59,698 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:59:59,699 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:59:59,699 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:59:59,699 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:59:59,699 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:59:59,700 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:59:59,700 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:59:59,700 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:59:59,701 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:59:59,702 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:59:59,702 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:59:59,702 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:59:59,703 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:59:59,703 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:59:59,703 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:59:59,703 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:59:59,703 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:59:59,704 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:59:59,704 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:59:59,704 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:59:59,704 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:59:59,705 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 11:59:59,705 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:59:59,705 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:59:59,705 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:59:59,705 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 11:59:59,706 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:00:00,000 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:00:00,015 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:00:00,018 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:00:00,020 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:00:00,020 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:00:00,021 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 12:00:00,105 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/afd2d9268/5d31e8e623144a35b10d2f94b7dfb6c1/FLAG6816d42aa
[2020-10-16 12:00:00,685 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:00:00,686 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 12:00:00,705 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/afd2d9268/5d31e8e623144a35b10d2f94b7dfb6c1/FLAG6816d42aa
[2020-10-16 12:00:00,980 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/afd2d9268/5d31e8e623144a35b10d2f94b7dfb6c1
[2020-10-16 12:00:00,989 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:00:00,991 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:00:00,992 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:00:00,992 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:00:00,995 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:00:00,996 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:00:00" (1/1) ...
[2020-10-16 12:00:00,999 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f1d44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:00, skipping insertion in model container
[2020-10-16 12:00:00,999 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:00:00" (1/1) ...
[2020-10-16 12:00:01,007 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:00:01,058 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:00:01,605 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:00:01,623 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:00:01,710 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:00:01,793 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:00:01,795 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01 WrapperNode
[2020-10-16 12:00:01,795 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:00:01,797 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:00:01,797 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:00:01,797 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:00:01,807 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:00:01" (1/1) ...
[2020-10-16 12:00:01,833 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:00:01" (1/1) ...
[2020-10-16 12:00:01,874 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:00:01,875 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:00:01,875 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:00:01,875 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:00:01,886 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,886 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,896 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,896 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,914 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,919 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,924 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (1/1) ...
[2020-10-16 12:00:01,930 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:00:01,930 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:00:01,930 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:00:01,931 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:00:01,932 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (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:00:02,010 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:00:02,010 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:00:02,011 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:00:02,011 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:00:02,011 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:00:02,011 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:00:02,011 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:00:02,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:00:02,012 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:00:02,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:00:02,012 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 12:00:02,013 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 12:00:02,013 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:00:02,013 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:00:02,013 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:00:02,016 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:00:04,186 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:00:04,187 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:00:04,191 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:00:04 BoogieIcfgContainer
[2020-10-16 12:00:04,191 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:00:04,193 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:00:04,194 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:00:04,197 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:00:04,198 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:00:00" (1/3) ...
[2020-10-16 12:00:04,199 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e698db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:00:04, skipping insertion in model container
[2020-10-16 12:00:04,199 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:00:01" (2/3) ...
[2020-10-16 12:00:04,199 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e698db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:00:04, skipping insertion in model container
[2020-10-16 12:00:04,199 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:00:04" (3/3) ...
[2020-10-16 12:00:04,201 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i
[2020-10-16 12:00:04,213 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:00:04,213 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:00:04,221 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:00:04,222 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:00:04,253 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,253 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,254 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,254 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,254 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,254 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,255 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,255 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,255 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,255 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,255 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,256 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,257 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,257 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,258 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,258 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,259 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,259 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,262 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,262 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,262 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,262 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,263 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,263 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,263 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,263 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,263 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,264 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,264 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,264 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,264 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,268 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,269 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,269 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,269 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,269 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,270 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,270 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,270 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,270 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,270 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,276 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,276 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,277 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,277 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,279 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,279 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,279 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,280 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,280 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,280 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,280 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,281 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,281 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,281 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,284 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,284 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,285 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:00:04,287 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:00:04,303 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 12:00:04,327 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:00:04,327 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:00:04,327 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:00:04,327 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 12:00:04,327 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:00:04,328 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:00:04,328 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:00:04,328 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:00:04,343 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:00:04,344 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 12:00:04,347 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 12:00:04,349 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-16 12:00:04,407 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-16 12:00:04,407 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:00:04,417 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 12:00:04,427 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-16 12:00:05,089 WARN  L193               SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 12:00:06,612 WARN  L193               SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2020-10-16 12:00:06,642 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term
[2020-10-16 12:00:06,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:00:06,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 12:00:06,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 12:00:08,078 WARN  L193               SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 148 DAG size of output: 127
[2020-10-16 12:00:09,892 WARN  L193               SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112
[2020-10-16 12:00:10,189 WARN  L193               SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 109
[2020-10-16 12:00:10,501 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 12:00:10,612 WARN  L193               SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 12:00:12,257 WARN  L193               SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 146 DAG size of output: 137
[2020-10-16 12:00:12,757 WARN  L193               SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 12:00:13,067 WARN  L193               SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 12:00:13,203 WARN  L193               SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 12:00:13,214 INFO  L132        LiptonReduction]: Checked pairs total: 7917
[2020-10-16 12:00:13,214 INFO  L134        LiptonReduction]: Total number of compositions: 90
[2020-10-16 12:00:13,221 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow
[2020-10-16 12:00:13,508 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-16 12:00:13,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-16 12:00:13,519 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 12:00:13,520 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:13,521 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:13,521 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:13,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:13,527 INFO  L82        PathProgramCache]: Analyzing trace with hash -836286608, now seen corresponding path program 1 times
[2020-10-16 12:00:13,538 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:13,539 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931768680]
[2020-10-16 12:00:13,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:13,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:13,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:00:13,801 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931768680]
[2020-10-16 12:00:13,802 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:13,802 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:00:13,803 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48268893]
[2020-10-16 12:00:13,808 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:00:13,809 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:13,826 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:00:13,827 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:00:13,829 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-16 12:00:13,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:13,969 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-16 12:00:13,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:00:13,972 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 12:00:13,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:14,016 INFO  L225             Difference]: With dead ends: 3250
[2020-10-16 12:00:14,016 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-16 12:00:14,018 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:00:14,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-16 12:00:14,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-16 12:00:14,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-16 12:00:14,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-16 12:00:14,228 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-16 12:00:14,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:14,229 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-16 12:00:14,230 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:00:14,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-16 12:00:14,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:00:14,235 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:14,235 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:14,235 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:00:14,236 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:14,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:14,236 INFO  L82        PathProgramCache]: Analyzing trace with hash 1410706723, now seen corresponding path program 1 times
[2020-10-16 12:00:14,236 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:14,237 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95496190]
[2020-10-16 12:00:14,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:14,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:14,366 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:00:14,367 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95496190]
[2020-10-16 12:00:14,367 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:14,367 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:00:14,367 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135415856]
[2020-10-16 12:00:14,369 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:00:14,369 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:14,369 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:00:14,370 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:00:14,370 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-16 12:00:14,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:14,404 INFO  L93              Difference]: Finished difference Result 2450 states and 9358 transitions.
[2020-10-16 12:00:14,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:00:14,405 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 12:00:14,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:14,428 INFO  L225             Difference]: With dead ends: 2450
[2020-10-16 12:00:14,428 INFO  L226             Difference]: Without dead ends: 2450
[2020-10-16 12:00:14,429 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:00:14,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2450 states.
[2020-10-16 12:00:14,514 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450.
[2020-10-16 12:00:14,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2450 states.
[2020-10-16 12:00:14,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions.
[2020-10-16 12:00:14,533 INFO  L78                 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11
[2020-10-16 12:00:14,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:14,534 INFO  L481      AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions.
[2020-10-16 12:00:14,534 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:00:14,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions.
[2020-10-16 12:00:14,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:00:14,538 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:14,539 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:14,539 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:00:14,539 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:14,539 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:14,539 INFO  L82        PathProgramCache]: Analyzing trace with hash -1541590479, now seen corresponding path program 1 times
[2020-10-16 12:00:14,540 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:14,540 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800990311]
[2020-10-16 12:00:14,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:14,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:14,639 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:00:14,639 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800990311]
[2020-10-16 12:00:14,640 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:14,640 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:00:14,640 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701911375]
[2020-10-16 12:00:14,641 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:00:14,641 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:14,641 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:00:14,641 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:00:14,641 INFO  L87              Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states.
[2020-10-16 12:00:14,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:14,686 INFO  L93              Difference]: Finished difference Result 2410 states and 9176 transitions.
[2020-10-16 12:00:14,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:00:14,688 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 12:00:14,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:14,713 INFO  L225             Difference]: With dead ends: 2410
[2020-10-16 12:00:14,713 INFO  L226             Difference]: Without dead ends: 2410
[2020-10-16 12:00:14,714 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:00:14,727 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2410 states.
[2020-10-16 12:00:14,801 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410.
[2020-10-16 12:00:14,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2410 states.
[2020-10-16 12:00:14,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions.
[2020-10-16 12:00:14,824 INFO  L78                 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 13
[2020-10-16 12:00:14,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:14,832 INFO  L481      AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions.
[2020-10-16 12:00:14,832 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:00:14,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions.
[2020-10-16 12:00:14,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:00:14,837 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:14,837 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:14,837 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:00:14,837 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:14,838 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:14,838 INFO  L82        PathProgramCache]: Analyzing trace with hash 1895245069, now seen corresponding path program 1 times
[2020-10-16 12:00:14,838 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:14,839 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904671633]
[2020-10-16 12:00:14,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:14,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:15,054 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:00:15,057 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904671633]
[2020-10-16 12:00:15,057 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:15,058 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:00:15,058 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011698930]
[2020-10-16 12:00:15,058 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:00:15,059 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:15,059 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:00:15,060 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:00:15,060 INFO  L87              Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states.
[2020-10-16 12:00:15,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:15,140 INFO  L93              Difference]: Finished difference Result 2386 states and 9070 transitions.
[2020-10-16 12:00:15,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:00:15,142 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-16 12:00:15,142 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:15,165 INFO  L225             Difference]: With dead ends: 2386
[2020-10-16 12:00:15,165 INFO  L226             Difference]: Without dead ends: 2386
[2020-10-16 12:00:15,166 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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:00:15,180 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2386 states.
[2020-10-16 12:00:15,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386.
[2020-10-16 12:00:15,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2386 states.
[2020-10-16 12:00:15,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions.
[2020-10-16 12:00:15,268 INFO  L78                 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14
[2020-10-16 12:00:15,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:15,268 INFO  L481      AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions.
[2020-10-16 12:00:15,268 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:00:15,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions.
[2020-10-16 12:00:15,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:00:15,273 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:15,273 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:15,273 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:00:15,274 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:15,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:15,274 INFO  L82        PathProgramCache]: Analyzing trace with hash -31126931, now seen corresponding path program 1 times
[2020-10-16 12:00:15,274 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:15,275 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763404227]
[2020-10-16 12:00:15,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:15,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:15,400 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:00:15,400 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763404227]
[2020-10-16 12:00:15,401 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:15,401 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:00:15,401 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340355556]
[2020-10-16 12:00:15,402 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:00:15,402 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:15,402 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:00:15,402 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:00:15,403 INFO  L87              Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states.
[2020-10-16 12:00:15,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:15,536 INFO  L93              Difference]: Finished difference Result 2378 states and 9024 transitions.
[2020-10-16 12:00:15,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:00:15,538 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 12:00:15,538 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:15,564 INFO  L225             Difference]: With dead ends: 2378
[2020-10-16 12:00:15,564 INFO  L226             Difference]: Without dead ends: 2378
[2020-10-16 12:00:15,565 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:15,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2378 states.
[2020-10-16 12:00:15,658 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338.
[2020-10-16 12:00:15,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2338 states.
[2020-10-16 12:00:15,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions.
[2020-10-16 12:00:15,675 INFO  L78                 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15
[2020-10-16 12:00:15,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:15,675 INFO  L481      AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions.
[2020-10-16 12:00:15,676 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:00:15,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions.
[2020-10-16 12:00:15,681 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:00:15,681 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:15,681 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:15,682 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:00:15,682 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:15,682 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:15,683 INFO  L82        PathProgramCache]: Analyzing trace with hash -1170026438, now seen corresponding path program 1 times
[2020-10-16 12:00:15,683 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:15,683 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845155749]
[2020-10-16 12:00:15,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:15,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:15,799 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:00:15,799 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845155749]
[2020-10-16 12:00:15,800 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:15,800 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:00:15,800 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485457423]
[2020-10-16 12:00:15,800 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:00:15,801 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:15,801 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:00:15,801 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:00:15,801 INFO  L87              Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 4 states.
[2020-10-16 12:00:15,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:15,883 INFO  L93              Difference]: Finished difference Result 2410 states and 9134 transitions.
[2020-10-16 12:00:15,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:00:15,884 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 12:00:15,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:15,899 INFO  L225             Difference]: With dead ends: 2410
[2020-10-16 12:00:15,900 INFO  L226             Difference]: Without dead ends: 2410
[2020-10-16 12:00:15,900 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:00:15,913 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2410 states.
[2020-10-16 12:00:15,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410.
[2020-10-16 12:00:15,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2410 states.
[2020-10-16 12:00:15,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions.
[2020-10-16 12:00:15,993 INFO  L78                 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15
[2020-10-16 12:00:15,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:15,994 INFO  L481      AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions.
[2020-10-16 12:00:15,994 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:00:15,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions.
[2020-10-16 12:00:15,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:00:15,999 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:15,999 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:00:16,000 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:00:16,000 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:16,000 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:16,000 INFO  L82        PathProgramCache]: Analyzing trace with hash -758016294, now seen corresponding path program 1 times
[2020-10-16 12:00:16,000 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:16,001 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694612297]
[2020-10-16 12:00:16,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:16,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:16,102 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:00:16,103 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694612297]
[2020-10-16 12:00:16,103 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:16,103 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:00:16,103 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212138384]
[2020-10-16 12:00:16,104 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:00:16,104 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:16,104 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:00:16,104 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:00:16,105 INFO  L87              Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 5 states.
[2020-10-16 12:00:16,231 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:16,232 INFO  L93              Difference]: Finished difference Result 2610 states and 9960 transitions.
[2020-10-16 12:00:16,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:00:16,233 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 12:00:16,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:16,247 INFO  L225             Difference]: With dead ends: 2610
[2020-10-16 12:00:16,248 INFO  L226             Difference]: Without dead ends: 2610
[2020-10-16 12:00:16,248 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:00:16,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2610 states.
[2020-10-16 12:00:16,386 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610.
[2020-10-16 12:00:16,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2610 states.
[2020-10-16 12:00:16,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions.
[2020-10-16 12:00:16,400 INFO  L78                 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16
[2020-10-16 12:00:16,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:16,400 INFO  L481      AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions.
[2020-10-16 12:00:16,400 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:00:16,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions.
[2020-10-16 12:00:16,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:00:16,405 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:16,405 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:00:16,406 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:00:16,406 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:16,406 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:16,406 INFO  L82        PathProgramCache]: Analyzing trace with hash -964935120, now seen corresponding path program 2 times
[2020-10-16 12:00:16,407 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:16,407 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826847579]
[2020-10-16 12:00:16,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:16,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:16,503 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:00:16,503 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826847579]
[2020-10-16 12:00:16,503 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:16,503 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:00:16,504 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164360253]
[2020-10-16 12:00:16,504 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:00:16,504 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:16,504 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:00:16,505 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:16,505 INFO  L87              Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states.
[2020-10-16 12:00:16,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:16,691 INFO  L93              Difference]: Finished difference Result 2970 states and 11282 transitions.
[2020-10-16 12:00:16,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:00:16,693 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 12:00:16,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:16,707 INFO  L225             Difference]: With dead ends: 2970
[2020-10-16 12:00:16,707 INFO  L226             Difference]: Without dead ends: 2970
[2020-10-16 12:00:16,708 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:00:16,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2970 states.
[2020-10-16 12:00:16,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2762.
[2020-10-16 12:00:16,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2762 states.
[2020-10-16 12:00:16,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions.
[2020-10-16 12:00:16,815 INFO  L78                 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16
[2020-10-16 12:00:16,815 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:16,815 INFO  L481      AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions.
[2020-10-16 12:00:16,815 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:00:16,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions.
[2020-10-16 12:00:16,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:00:16,825 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:16,825 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:16,825 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:00:16,825 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:16,825 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:16,826 INFO  L82        PathProgramCache]: Analyzing trace with hash -262450869, now seen corresponding path program 1 times
[2020-10-16 12:00:16,826 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:16,826 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664938163]
[2020-10-16 12:00:16,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:16,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:17,074 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:00:17,075 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664938163]
[2020-10-16 12:00:17,075 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:17,075 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:00:17,076 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045255036]
[2020-10-16 12:00:17,076 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:00:17,076 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:17,076 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:00:17,077 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:17,077 INFO  L87              Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states.
[2020-10-16 12:00:17,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:17,290 INFO  L93              Difference]: Finished difference Result 3362 states and 12748 transitions.
[2020-10-16 12:00:17,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:00:17,291 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 12:00:17,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:17,307 INFO  L225             Difference]: With dead ends: 3362
[2020-10-16 12:00:17,307 INFO  L226             Difference]: Without dead ends: 3362
[2020-10-16 12:00:17,308 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:00:17,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3362 states.
[2020-10-16 12:00:17,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2962.
[2020-10-16 12:00:17,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2962 states.
[2020-10-16 12:00:17,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11256 transitions.
[2020-10-16 12:00:17,413 INFO  L78                 Accepts]: Start accepts. Automaton has 2962 states and 11256 transitions. Word has length 17
[2020-10-16 12:00:17,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:17,414 INFO  L481      AbstractCegarLoop]: Abstraction has 2962 states and 11256 transitions.
[2020-10-16 12:00:17,414 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:00:17,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 2962 states and 11256 transitions.
[2020-10-16 12:00:17,421 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:00:17,421 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:17,421 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:17,422 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:00:17,422 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:17,422 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:17,422 INFO  L82        PathProgramCache]: Analyzing trace with hash 151780047, now seen corresponding path program 2 times
[2020-10-16 12:00:17,422 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:17,423 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111754007]
[2020-10-16 12:00:17,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:17,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:17,725 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:00:17,725 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111754007]
[2020-10-16 12:00:17,725 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:17,726 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:00:17,726 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87349897]
[2020-10-16 12:00:17,726 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:00:17,726 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:17,727 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:00:17,727 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:17,727 INFO  L87              Difference]: Start difference. First operand 2962 states and 11256 transitions. Second operand 7 states.
[2020-10-16 12:00:18,087 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:18,087 INFO  L93              Difference]: Finished difference Result 3082 states and 11638 transitions.
[2020-10-16 12:00:18,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:00:18,088 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 12:00:18,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:18,104 INFO  L225             Difference]: With dead ends: 3082
[2020-10-16 12:00:18,105 INFO  L226             Difference]: Without dead ends: 3082
[2020-10-16 12:00:18,105 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:00:18,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3082 states.
[2020-10-16 12:00:18,187 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2506.
[2020-10-16 12:00:18,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2506 states.
[2020-10-16 12:00:18,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9438 transitions.
[2020-10-16 12:00:18,200 INFO  L78                 Accepts]: Start accepts. Automaton has 2506 states and 9438 transitions. Word has length 17
[2020-10-16 12:00:18,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:18,200 INFO  L481      AbstractCegarLoop]: Abstraction has 2506 states and 9438 transitions.
[2020-10-16 12:00:18,200 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:00:18,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 2506 states and 9438 transitions.
[2020-10-16 12:00:18,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:00:18,206 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:18,206 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:18,206 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:00:18,207 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:18,207 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:18,207 INFO  L82        PathProgramCache]: Analyzing trace with hash 825285145, now seen corresponding path program 1 times
[2020-10-16 12:00:18,207 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:18,208 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392166177]
[2020-10-16 12:00:18,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:18,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:18,344 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:00:18,345 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392166177]
[2020-10-16 12:00:18,345 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:18,345 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:00:18,345 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015669846]
[2020-10-16 12:00:18,346 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:00:18,346 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:18,346 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:00:18,346 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:18,347 INFO  L87              Difference]: Start difference. First operand 2506 states and 9438 transitions. Second operand 6 states.
[2020-10-16 12:00:18,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:18,459 INFO  L93              Difference]: Finished difference Result 2714 states and 10292 transitions.
[2020-10-16 12:00:18,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:00:18,460 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 12:00:18,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:18,471 INFO  L225             Difference]: With dead ends: 2714
[2020-10-16 12:00:18,471 INFO  L226             Difference]: Without dead ends: 2714
[2020-10-16 12:00:18,472 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:18,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2714 states.
[2020-10-16 12:00:18,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2530.
[2020-10-16 12:00:18,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2530 states.
[2020-10-16 12:00:18,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 9526 transitions.
[2020-10-16 12:00:18,565 INFO  L78                 Accepts]: Start accepts. Automaton has 2530 states and 9526 transitions. Word has length 17
[2020-10-16 12:00:18,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:18,566 INFO  L481      AbstractCegarLoop]: Abstraction has 2530 states and 9526 transitions.
[2020-10-16 12:00:18,566 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:00:18,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 2530 states and 9526 transitions.
[2020-10-16 12:00:18,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:00:18,572 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:18,572 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:18,573 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:00:18,573 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:18,573 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:18,573 INFO  L82        PathProgramCache]: Analyzing trace with hash 885957849, now seen corresponding path program 1 times
[2020-10-16 12:00:18,574 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:18,574 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327054910]
[2020-10-16 12:00:18,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:18,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:18,620 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:00:18,620 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327054910]
[2020-10-16 12:00:18,620 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:18,620 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:00:18,621 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660552949]
[2020-10-16 12:00:18,621 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:00:18,621 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:18,622 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:00:18,622 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:00:18,622 INFO  L87              Difference]: Start difference. First operand 2530 states and 9526 transitions. Second operand 4 states.
[2020-10-16 12:00:18,663 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:18,663 INFO  L93              Difference]: Finished difference Result 3526 states and 13121 transitions.
[2020-10-16 12:00:18,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:00:18,664 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-16 12:00:18,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:18,675 INFO  L225             Difference]: With dead ends: 3526
[2020-10-16 12:00:18,676 INFO  L226             Difference]: Without dead ends: 2242
[2020-10-16 12:00:18,676 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:00:18,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2242 states.
[2020-10-16 12:00:18,742 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2170.
[2020-10-16 12:00:18,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2170 states.
[2020-10-16 12:00:18,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7804 transitions.
[2020-10-16 12:00:18,753 INFO  L78                 Accepts]: Start accepts. Automaton has 2170 states and 7804 transitions. Word has length 17
[2020-10-16 12:00:18,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:18,753 INFO  L481      AbstractCegarLoop]: Abstraction has 2170 states and 7804 transitions.
[2020-10-16 12:00:18,753 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:00:18,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 2170 states and 7804 transitions.
[2020-10-16 12:00:18,759 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 12:00:18,759 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:18,759 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:18,759 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 12:00:18,760 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:18,760 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:18,760 INFO  L82        PathProgramCache]: Analyzing trace with hash -388101251, now seen corresponding path program 2 times
[2020-10-16 12:00:18,760 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:18,761 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78584211]
[2020-10-16 12:00:18,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:18,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:18,837 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:00:18,837 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78584211]
[2020-10-16 12:00:18,837 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:18,838 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:00:18,838 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290496089]
[2020-10-16 12:00:18,838 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:00:18,838 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:18,839 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:00:18,839 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:00:18,839 INFO  L87              Difference]: Start difference. First operand 2170 states and 7804 transitions. Second operand 4 states.
[2020-10-16 12:00:18,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:18,891 INFO  L93              Difference]: Finished difference Result 2236 states and 7326 transitions.
[2020-10-16 12:00:18,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:00:18,892 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-16 12:00:18,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:18,899 INFO  L225             Difference]: With dead ends: 2236
[2020-10-16 12:00:18,900 INFO  L226             Difference]: Without dead ends: 1660
[2020-10-16 12:00:18,900 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:00:18,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1660 states.
[2020-10-16 12:00:18,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660.
[2020-10-16 12:00:18,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1660 states.
[2020-10-16 12:00:18,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 5380 transitions.
[2020-10-16 12:00:18,946 INFO  L78                 Accepts]: Start accepts. Automaton has 1660 states and 5380 transitions. Word has length 17
[2020-10-16 12:00:18,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:18,947 INFO  L481      AbstractCegarLoop]: Abstraction has 1660 states and 5380 transitions.
[2020-10-16 12:00:18,947 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:00:18,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 1660 states and 5380 transitions.
[2020-10-16 12:00:18,950 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:00:18,951 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:18,951 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:00:18,951 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 12:00:18,951 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:18,951 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:18,952 INFO  L82        PathProgramCache]: Analyzing trace with hash -283043781, now seen corresponding path program 1 times
[2020-10-16 12:00:18,952 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:18,952 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694655321]
[2020-10-16 12:00:18,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:18,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:19,031 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:00:19,032 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694655321]
[2020-10-16 12:00:19,032 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:19,032 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:00:19,032 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933310206]
[2020-10-16 12:00:19,033 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:00:19,033 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:19,033 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:00:19,033 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:00:19,034 INFO  L87              Difference]: Start difference. First operand 1660 states and 5380 transitions. Second operand 5 states.
[2020-10-16 12:00:19,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:19,100 INFO  L93              Difference]: Finished difference Result 1445 states and 4330 transitions.
[2020-10-16 12:00:19,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:00:19,101 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-16 12:00:19,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:19,106 INFO  L225             Difference]: With dead ends: 1445
[2020-10-16 12:00:19,106 INFO  L226             Difference]: Without dead ends: 1103
[2020-10-16 12:00:19,108 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:00:19,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1103 states.
[2020-10-16 12:00:19,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103.
[2020-10-16 12:00:19,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1103 states.
[2020-10-16 12:00:19,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3254 transitions.
[2020-10-16 12:00:19,142 INFO  L78                 Accepts]: Start accepts. Automaton has 1103 states and 3254 transitions. Word has length 18
[2020-10-16 12:00:19,142 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:19,142 INFO  L481      AbstractCegarLoop]: Abstraction has 1103 states and 3254 transitions.
[2020-10-16 12:00:19,142 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:00:19,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 1103 states and 3254 transitions.
[2020-10-16 12:00:19,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 12:00:19,148 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:19,148 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]
[2020-10-16 12:00:19,148 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 12:00:19,148 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:19,149 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:19,149 INFO  L82        PathProgramCache]: Analyzing trace with hash -1193922686, now seen corresponding path program 1 times
[2020-10-16 12:00:19,149 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:19,150 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263922536]
[2020-10-16 12:00:19,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:19,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:19,220 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:00:19,220 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263922536]
[2020-10-16 12:00:19,220 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:19,221 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:00:19,221 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823274878]
[2020-10-16 12:00:19,221 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:00:19,221 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:19,222 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:00:19,222 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:00:19,223 INFO  L87              Difference]: Start difference. First operand 1103 states and 3254 transitions. Second operand 3 states.
[2020-10-16 12:00:19,238 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:19,238 INFO  L93              Difference]: Finished difference Result 1583 states and 4529 transitions.
[2020-10-16 12:00:19,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:00:19,240 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-16 12:00:19,240 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:19,243 INFO  L225             Difference]: With dead ends: 1583
[2020-10-16 12:00:19,243 INFO  L226             Difference]: Without dead ends: 1117
[2020-10-16 12:00:19,245 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:00:19,250 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1117 states.
[2020-10-16 12:00:19,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1089.
[2020-10-16 12:00:19,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1089 states.
[2020-10-16 12:00:19,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 3029 transitions.
[2020-10-16 12:00:19,348 INFO  L78                 Accepts]: Start accepts. Automaton has 1089 states and 3029 transitions. Word has length 20
[2020-10-16 12:00:19,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:19,348 INFO  L481      AbstractCegarLoop]: Abstraction has 1089 states and 3029 transitions.
[2020-10-16 12:00:19,349 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:00:19,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 1089 states and 3029 transitions.
[2020-10-16 12:00:19,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 12:00:19,352 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:19,353 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:00:19,353 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 12:00:19,353 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:19,353 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:19,354 INFO  L82        PathProgramCache]: Analyzing trace with hash 453402744, now seen corresponding path program 1 times
[2020-10-16 12:00:19,354 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:19,354 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545944378]
[2020-10-16 12:00:19,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:19,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:19,477 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:00:19,477 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545944378]
[2020-10-16 12:00:19,478 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:19,478 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:00:19,478 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356398686]
[2020-10-16 12:00:19,478 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:00:19,479 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:19,479 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:00:19,482 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:19,482 INFO  L87              Difference]: Start difference. First operand 1089 states and 3029 transitions. Second operand 6 states.
[2020-10-16 12:00:19,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:19,553 INFO  L93              Difference]: Finished difference Result 968 states and 2655 transitions.
[2020-10-16 12:00:19,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:00:19,554 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-16 12:00:19,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:19,557 INFO  L225             Difference]: With dead ends: 968
[2020-10-16 12:00:19,558 INFO  L226             Difference]: Without dead ends: 799
[2020-10-16 12:00:19,558 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:00:19,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 799 states.
[2020-10-16 12:00:19,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 791.
[2020-10-16 12:00:19,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 791 states.
[2020-10-16 12:00:19,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2195 transitions.
[2020-10-16 12:00:19,579 INFO  L78                 Accepts]: Start accepts. Automaton has 791 states and 2195 transitions. Word has length 21
[2020-10-16 12:00:19,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:19,580 INFO  L481      AbstractCegarLoop]: Abstraction has 791 states and 2195 transitions.
[2020-10-16 12:00:19,580 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:00:19,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 791 states and 2195 transitions.
[2020-10-16 12:00:19,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 12:00:19,584 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:19,585 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, 1, 1, 1]
[2020-10-16 12:00:19,585 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 12:00:19,585 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:19,585 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:19,586 INFO  L82        PathProgramCache]: Analyzing trace with hash -655976501, now seen corresponding path program 1 times
[2020-10-16 12:00:19,586 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:19,586 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864892877]
[2020-10-16 12:00:19,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:19,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:19,694 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:00:19,695 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864892877]
[2020-10-16 12:00:19,697 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:19,697 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:00:19,697 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615105113]
[2020-10-16 12:00:19,698 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:00:19,698 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:19,698 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:00:19,699 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:19,699 INFO  L87              Difference]: Start difference. First operand 791 states and 2195 transitions. Second operand 6 states.
[2020-10-16 12:00:19,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:19,840 INFO  L93              Difference]: Finished difference Result 1324 states and 3564 transitions.
[2020-10-16 12:00:19,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:00:19,842 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2020-10-16 12:00:19,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:19,845 INFO  L225             Difference]: With dead ends: 1324
[2020-10-16 12:00:19,845 INFO  L226             Difference]: Without dead ends: 1018
[2020-10-16 12:00:19,846 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:19,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1018 states.
[2020-10-16 12:00:19,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 975.
[2020-10-16 12:00:19,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 975 states.
[2020-10-16 12:00:19,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2665 transitions.
[2020-10-16 12:00:19,871 INFO  L78                 Accepts]: Start accepts. Automaton has 975 states and 2665 transitions. Word has length 24
[2020-10-16 12:00:19,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:19,871 INFO  L481      AbstractCegarLoop]: Abstraction has 975 states and 2665 transitions.
[2020-10-16 12:00:19,871 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:00:19,871 INFO  L276                IsEmpty]: Start isEmpty. Operand 975 states and 2665 transitions.
[2020-10-16 12:00:19,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 12:00:19,874 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:19,874 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, 1, 1, 1]
[2020-10-16 12:00:19,874 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 12:00:19,875 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:19,875 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:19,875 INFO  L82        PathProgramCache]: Analyzing trace with hash -168689361, now seen corresponding path program 1 times
[2020-10-16 12:00:19,875 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:19,876 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477187161]
[2020-10-16 12:00:19,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:19,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:20,012 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:00:20,013 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477187161]
[2020-10-16 12:00:20,014 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:20,014 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:00:20,014 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413037924]
[2020-10-16 12:00:20,014 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:00:20,015 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:20,015 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:00:20,015 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:20,015 INFO  L87              Difference]: Start difference. First operand 975 states and 2665 transitions. Second operand 7 states.
[2020-10-16 12:00:20,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:20,098 INFO  L93              Difference]: Finished difference Result 946 states and 2607 transitions.
[2020-10-16 12:00:20,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:00:20,099 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-16 12:00:20,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:20,100 INFO  L225             Difference]: With dead ends: 946
[2020-10-16 12:00:20,101 INFO  L226             Difference]: Without dead ends: 336
[2020-10-16 12:00:20,101 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:00:20,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2020-10-16 12:00:20,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336.
[2020-10-16 12:00:20,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 336 states.
[2020-10-16 12:00:20,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 923 transitions.
[2020-10-16 12:00:20,109 INFO  L78                 Accepts]: Start accepts. Automaton has 336 states and 923 transitions. Word has length 24
[2020-10-16 12:00:20,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:20,109 INFO  L481      AbstractCegarLoop]: Abstraction has 336 states and 923 transitions.
[2020-10-16 12:00:20,110 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:00:20,110 INFO  L276                IsEmpty]: Start isEmpty. Operand 336 states and 923 transitions.
[2020-10-16 12:00:20,111 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 12:00:20,111 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:20,111 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, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:20,111 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 12:00:20,111 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:20,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:20,112 INFO  L82        PathProgramCache]: Analyzing trace with hash 751760158, now seen corresponding path program 1 times
[2020-10-16 12:00:20,112 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:20,112 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207544813]
[2020-10-16 12:00:20,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:20,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:20,197 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:00:20,197 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207544813]
[2020-10-16 12:00:20,197 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:20,197 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:00:20,198 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264692963]
[2020-10-16 12:00:20,198 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:00:20,198 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:20,199 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:00:20,199 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:00:20,199 INFO  L87              Difference]: Start difference. First operand 336 states and 923 transitions. Second operand 6 states.
[2020-10-16 12:00:20,290 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:20,290 INFO  L93              Difference]: Finished difference Result 437 states and 1183 transitions.
[2020-10-16 12:00:20,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:00:20,291 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 27
[2020-10-16 12:00:20,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:20,292 INFO  L225             Difference]: With dead ends: 437
[2020-10-16 12:00:20,292 INFO  L226             Difference]: Without dead ends: 138
[2020-10-16 12:00:20,293 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:00:20,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-16 12:00:20,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2020-10-16 12:00:20,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2020-10-16 12:00:20,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions.
[2020-10-16 12:00:20,296 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27
[2020-10-16 12:00:20,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:20,296 INFO  L481      AbstractCegarLoop]: Abstraction has 138 states and 323 transitions.
[2020-10-16 12:00:20,296 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:00:20,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions.
[2020-10-16 12:00:20,297 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 12:00:20,297 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:20,297 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, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:20,297 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 12:00:20,298 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:20,298 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:20,298 INFO  L82        PathProgramCache]: Analyzing trace with hash 114942006, now seen corresponding path program 2 times
[2020-10-16 12:00:20,298 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:20,298 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331906458]
[2020-10-16 12:00:20,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:20,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:00:20,516 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:00:20,517 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331906458]
[2020-10-16 12:00:20,517 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:00:20,517 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:00:20,517 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787853516]
[2020-10-16 12:00:20,518 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:00:20,518 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:00:20,518 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:00:20,518 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:00:20,518 INFO  L87              Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 7 states.
[2020-10-16 12:00:20,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:00:20,639 INFO  L93              Difference]: Finished difference Result 188 states and 441 transitions.
[2020-10-16 12:00:20,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:00:20,640 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 27
[2020-10-16 12:00:20,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:00:20,640 INFO  L225             Difference]: With dead ends: 188
[2020-10-16 12:00:20,641 INFO  L226             Difference]: Without dead ends: 138
[2020-10-16 12:00:20,641 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:00:20,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-16 12:00:20,645 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114.
[2020-10-16 12:00:20,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2020-10-16 12:00:20,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions.
[2020-10-16 12:00:20,647 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 27
[2020-10-16 12:00:20,647 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:00:20,647 INFO  L481      AbstractCegarLoop]: Abstraction has 114 states and 243 transitions.
[2020-10-16 12:00:20,647 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:00:20,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions.
[2020-10-16 12:00:20,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 12:00:20,648 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:00:20,648 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, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:00:20,649 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 12:00:20,649 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:00:20,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:00:20,649 INFO  L82        PathProgramCache]: Analyzing trace with hash 1014745852, now seen corresponding path program 3 times
[2020-10-16 12:00:20,649 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:00:20,654 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257374965]
[2020-10-16 12:00:20,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:00:20,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:00:20,713 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:00:20,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:00:20,752 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:00:20,810 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:00:20,810 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:00:20,811 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-16 12:00:20,812 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 12:00:20,829 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-1057754805 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1057754805 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1057754805 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1057754805 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out-1057754805 0) .cse1) (and (= ~y$w_buff1_used~0_Out-1057754805 ~y$w_buff1_used~0_In-1057754805) .cse2)) (= ~y$r_buff0_thd0~0_Out-1057754805 ~y$r_buff0_thd0~0_In-1057754805) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1057754805| ULTIMATE.start_assume_abort_if_not_~cond_Out-1057754805) (or (and .cse3 (or (and (= ~y~0_Out-1057754805 ~y~0_In-1057754805) .cse2) (and .cse0 (= ~y$w_buff1~0_In-1057754805 ~y~0_Out-1057754805) .cse1))) (and .cse4 (= ~y~0_Out-1057754805 ~y$w_buff0~0_In-1057754805) .cse5)) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-1057754805 0)) (and .cse3 (= ~y$w_buff0_used~0_Out-1057754805 ~y$w_buff0_used~0_In-1057754805))) (= ~y$r_buff1_thd0~0_In-1057754805 ~y$r_buff1_thd0~0_Out-1057754805) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1057754805 0)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1057754805|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057754805, ~y$w_buff1~0=~y$w_buff1~0_In-1057754805, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1057754805, ~y$w_buff0~0=~y$w_buff0~0_In-1057754805, ~y~0=~y~0_In-1057754805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1057754805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057754805}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1057754805, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1057754805|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1057754805|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1057754805|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1057754805|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1057754805|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1057754805|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1057754805|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1057754805, ~y$w_buff1~0=~y$w_buff1~0_In-1057754805, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1057754805, ~y$w_buff0~0=~y$w_buff0~0_In-1057754805, ~y~0=~y~0_Out-1057754805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1057754805, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1057754805}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 12:00:20,848 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:00:20,848 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,849 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:00:20,850 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,850 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:00:20,851 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,851 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:00:20,851 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,851 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:00:20,852 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,852 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:00:20,852 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,852 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:00:20,852 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,855 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:00:20,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,856 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:00:20,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,856 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:00:20,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,857 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:00:20,857 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,857 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:00:20,857 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,858 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:00:20,858 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,858 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:00:20,859 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,859 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:00:20,859 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,859 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:00:20,859 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,860 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:00:20,860 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,866 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:00:20,866 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,866 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:00:20,867 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,867 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:00:20,867 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,867 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:00:20,867 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,868 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:00:20,868 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,869 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:00:20,869 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,869 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:00:20,869 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,870 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:00:20,870 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,870 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:00:20,870 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,871 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:00:20,871 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,871 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:00:20,871 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:00:20,997 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:00:20 BasicIcfg
[2020-10-16 12:00:20,998 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:00:21,000 INFO  L168              Benchmark]: Toolchain (without parser) took 20009.37 ms. Allocated memory was 140.5 MB in the beginning and 507.0 MB in the end (delta: 366.5 MB). Free memory was 101.9 MB in the beginning and 160.9 MB in the end (delta: -59.0 MB). Peak memory consumption was 307.5 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,001 INFO  L168              Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,001 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 804.08 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 155.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,002 INFO  L168              Benchmark]: Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,002 INFO  L168              Benchmark]: Boogie Preprocessor took 55.31 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,003 INFO  L168              Benchmark]: RCFGBuilder took 2261.19 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 149.7 MB in the beginning and 163.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,004 INFO  L168              Benchmark]: TraceAbstraction took 16804.37 ms. Allocated memory was 248.0 MB in the beginning and 507.0 MB in the end (delta: 259.0 MB). Free memory was 161.3 MB in the beginning and 160.9 MB in the end (delta: 462.2 kB). Peak memory consumption was 259.5 MB. Max. memory is 7.1 GB.
[2020-10-16 12:00:21,007 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.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 804.08 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 155.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 55.31 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2261.19 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 149.7 MB in the beginning and 163.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 16804.37 ms. Allocated memory was 248.0 MB in the beginning and 507.0 MB in the end (delta: 259.0 MB). Free memory was 161.3 MB in the beginning and 160.9 MB in the end (delta: 462.2 kB). Peak memory consumption was 259.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1318 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 7917 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p2_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t577;
[L836]  FCALL, FORK  0  pthread_create(&t577, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L837]               0  pthread_t t578;
[L838]  FCALL, FORK  0  pthread_create(&t578, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L839]               0  pthread_t t579;
[L840]  FCALL, FORK  0  pthread_create(&t579, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               0  pthread_t t580;
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L784]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]  FCALL, FORK  0  pthread_create(&t580, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L787]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L804]               4  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L807]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L810]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L814]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L815]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L816]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L816]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L817]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L817]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L742]               1  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L754]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  y$flush_delayed = weak$$choice2
[L858]               0  y$mem_tmp = y
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L860]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L860]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L861]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L861]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L862]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L862]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L864]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L867]               0  y = y$flush_delayed ? y$mem_tmp : y
[L868]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 682 SDtfs, 915 SDslu, 1171 SDs, 0 SdLazy, 554 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1583 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 54818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...