/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:15:49,836 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:15:49,839 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:15:49,881 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:15:49,881 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:15:49,889 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:15:49,892 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:15:49,895 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:15:49,898 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:15:49,901 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:15:49,902 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:15:49,903 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:15:49,903 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:15:49,906 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:15:49,908 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:15:49,909 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:15:49,910 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:15:49,911 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:15:49,912 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:15:49,920 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:15:49,923 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:15:49,924 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:15:49,925 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:15:49,926 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:15:49,937 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:15:49,938 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:15:49,938 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:15:49,939 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:15:49,940 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:15:49,940 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:15:49,941 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:15:49,942 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:15:49,943 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:15:49,944 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:15:49,945 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:15:49,945 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:15:49,945 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:15:49,945 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:15:49,946 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:15:49,946 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:15:49,947 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:15:49,948 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:15:49,991 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:15:49,992 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:15:49,993 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:15:49,993 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:15:49,994 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:15:49,994 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:15:49,994 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:15:49,994 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:15:49,994 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:15:49,995 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:15:49,996 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:15:49,996 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:15:49,996 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:15:49,996 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:15:49,997 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:15:49,997 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:15:49,997 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:15:49,997 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:15:49,997 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:15:49,998 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:15:49,998 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:15:49,998 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:15:49,998 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:15:49,998 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:15:49,999 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:15:49,999 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:15:49,999 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:15:49,999 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:15:49,999 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:15:50,000 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:15:50,299 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:15:50,315 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:15:50,319 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:15:50,320 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:15:50,323 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:15:50,323 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i
[2020-10-16 11:15:50,381 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/853293727/820add40df074e92b545d82fc1e13722/FLAGd025e48f5
[2020-10-16 11:15:50,877 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:15:50,878 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i
[2020-10-16 11:15:50,895 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/853293727/820add40df074e92b545d82fc1e13722/FLAGd025e48f5
[2020-10-16 11:15:51,207 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/853293727/820add40df074e92b545d82fc1e13722
[2020-10-16 11:15:51,215 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:15:51,217 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:15:51,218 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:15:51,218 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:15:51,221 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:15:51,222 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:51,225 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfb1a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51, skipping insertion in model container
[2020-10-16 11:15:51,225 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:51,232 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:15:51,282 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:15:51,818 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:15:51,835 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:15:51,909 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:15:51,987 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:15:51,987 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51 WrapperNode
[2020-10-16 11:15:51,987 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:15:51,988 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:15:51,988 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:15:51,988 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:15:51,997 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,015 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,048 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:15:52,048 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:15:52,048 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:15:52,048 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:15:52,057 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,057 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,061 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,062 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,070 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,074 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,077 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (1/1) ...
[2020-10-16 11:15:52,081 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:15:52,082 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:15:52,082 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:15:52,082 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:15:52,083 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (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 11:15:52,147 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:15:52,147 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:15:52,147 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:15:52,147 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:15:52,147 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:15:52,148 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:15:52,153 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:15:52,153 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:15:52,153 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:15:52,154 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:15:52,154 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:15:52,157 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 11:15:53,779 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:15:53,779 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:15:53,781 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:53 BoogieIcfgContainer
[2020-10-16 11:15:53,781 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:15:53,783 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:15:53,783 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:15:53,786 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:15:53,787 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:15:51" (1/3) ...
[2020-10-16 11:15:53,787 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8aee0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:53, skipping insertion in model container
[2020-10-16 11:15:53,787 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:51" (2/3) ...
[2020-10-16 11:15:53,788 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8aee0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:53, skipping insertion in model container
[2020-10-16 11:15:53,788 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:53" (3/3) ...
[2020-10-16 11:15:53,790 INFO  L111   eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i
[2020-10-16 11:15:53,801 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:15:53,801 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:15:53,810 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:15:53,811 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:15:53,838 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,838 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,839 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,839 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,839 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,840 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,840 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,840 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,840 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,840 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,842 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,842 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,842 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,842 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,842 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,843 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,843 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,843 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,843 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,843 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,848 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,848 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,849 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,849 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,849 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,850 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,850 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,850 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,850 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,851 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,852 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,852 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,856 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,856 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,857 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,857 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,857 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,857 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,857 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,858 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,858 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,858 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,858 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,858 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,859 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,859 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,859 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,859 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,859 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,860 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,860 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,860 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,860 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,860 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,861 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,861 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,861 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,861 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,862 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,866 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,866 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,866 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,866 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,867 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,867 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,867 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,867 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,867 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,868 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,868 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,868 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:53,870 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:15:53,883 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2020-10-16 11:15:53,904 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:15:53,904 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:15:53,904 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:15:53,904 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:15:53,904 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:15:53,904 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:15:53,905 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:15:53,905 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:15:53,917 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:15:53,920 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 168 flow
[2020-10-16 11:15:53,923 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 168 flow
[2020-10-16 11:15:53,925 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow
[2020-10-16 11:15:53,966 INFO  L129       PetriNetUnfolder]: 2/77 cut-off events.
[2020-10-16 11:15:53,966 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:15:53,971 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. 
[2020-10-16 11:15:53,973 INFO  L117        LiptonReduction]: Number of co-enabled transitions 936
[2020-10-16 11:15:54,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,401 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:54,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:54,406 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:54,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:54,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:54,460 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,461 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:54,462 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,463 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:54,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:54,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:54,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:54,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:54,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:54,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:54,881 WARN  L193               SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:15:55,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:55,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:55,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,053 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,060 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,073 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:55,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,123 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,240 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:55,241 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:55,245 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,246 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,248 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,250 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,254 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,254 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:55,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,292 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,513 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,514 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,573 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,573 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:15:55,576 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,577 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:55,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:55,622 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:55,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,625 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,629 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,630 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:55,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:55,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,637 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:55,638 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:55,639 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,144 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,145 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,146 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,146 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,148 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:56,148 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,149 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,150 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,151 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,180 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:15:56,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:56,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:15:56,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:56,279 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,315 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,318 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,320 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:56,325 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:56,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,336 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,337 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:15:56,340 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,378 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:56,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:56,390 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,412 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,413 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:56,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:56,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:56,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,619 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:56,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:56,625 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:56,644 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,646 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:56,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:56,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:56,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:56,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:57,501 WARN  L193               SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85
[2020-10-16 11:15:57,600 INFO  L132        LiptonReduction]: Checked pairs total: 2114
[2020-10-16 11:15:57,600 INFO  L134        LiptonReduction]: Total number of compositions: 71
[2020-10-16 11:15:57,607 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow
[2020-10-16 11:15:57,624 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 150 states.
[2020-10-16 11:15:57,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 150 states.
[2020-10-16 11:15:57,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 11:15:57,632 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:57,633 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 11:15:57,633 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:57,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:57,640 INFO  L82        PathProgramCache]: Analyzing trace with hash 787969272, now seen corresponding path program 1 times
[2020-10-16 11:15:57,650 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:57,650 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896202639]
[2020-10-16 11:15:57,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:57,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:57,940 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 11:15:57,941 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896202639]
[2020-10-16 11:15:57,942 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:57,942 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:15:57,942 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650488232]
[2020-10-16 11:15:57,947 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:57,947 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:57,961 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:57,962 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:57,964 INFO  L87              Difference]: Start difference. First operand 150 states. Second operand 3 states.
[2020-10-16 11:15:58,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,014 INFO  L93              Difference]: Finished difference Result 130 states and 302 transitions.
[2020-10-16 11:15:58,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:58,017 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 11:15:58,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,029 INFO  L225             Difference]: With dead ends: 130
[2020-10-16 11:15:58,029 INFO  L226             Difference]: Without dead ends: 106
[2020-10-16 11:15:58,030 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 11:15:58,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2020-10-16 11:15:58,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2020-10-16 11:15:58,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 106 states.
[2020-10-16 11:15:58,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 240 transitions.
[2020-10-16 11:15:58,078 INFO  L78                 Accepts]: Start accepts. Automaton has 106 states and 240 transitions. Word has length 5
[2020-10-16 11:15:58,079 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,079 INFO  L481      AbstractCegarLoop]: Abstraction has 106 states and 240 transitions.
[2020-10-16 11:15:58,079 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:58,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 106 states and 240 transitions.
[2020-10-16 11:15:58,080 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:15:58,080 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,080 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,080 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:15:58,081 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,081 INFO  L82        PathProgramCache]: Analyzing trace with hash 1324291626, now seen corresponding path program 1 times
[2020-10-16 11:15:58,081 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,082 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885961409]
[2020-10-16 11:15:58,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:58,149 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 11:15:58,150 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885961409]
[2020-10-16 11:15:58,150 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:58,150 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:15:58,151 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401815076]
[2020-10-16 11:15:58,152 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:58,152 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:58,152 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:58,153 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:58,153 INFO  L87              Difference]: Start difference. First operand 106 states and 240 transitions. Second operand 3 states.
[2020-10-16 11:15:58,162 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,163 INFO  L93              Difference]: Finished difference Result 98 states and 218 transitions.
[2020-10-16 11:15:58,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:58,166 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:15:58,166 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,167 INFO  L225             Difference]: With dead ends: 98
[2020-10-16 11:15:58,168 INFO  L226             Difference]: Without dead ends: 98
[2020-10-16 11:15:58,168 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 11:15:58,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2020-10-16 11:15:58,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2020-10-16 11:15:58,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2020-10-16 11:15:58,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 218 transitions.
[2020-10-16 11:15:58,187 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 218 transitions. Word has length 7
[2020-10-16 11:15:58,187 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,190 INFO  L481      AbstractCegarLoop]: Abstraction has 98 states and 218 transitions.
[2020-10-16 11:15:58,190 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:58,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 218 transitions.
[2020-10-16 11:15:58,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:15:58,191 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,191 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,191 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:15:58,192 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,192 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,192 INFO  L82        PathProgramCache]: Analyzing trace with hash 1333904370, now seen corresponding path program 1 times
[2020-10-16 11:15:58,192 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,193 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663878864]
[2020-10-16 11:15:58,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:58,316 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 11:15:58,316 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663878864]
[2020-10-16 11:15:58,316 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:58,317 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:15:58,317 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635914275]
[2020-10-16 11:15:58,317 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:15:58,317 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:58,318 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:15:58,318 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:15:58,318 INFO  L87              Difference]: Start difference. First operand 98 states and 218 transitions. Second operand 4 states.
[2020-10-16 11:15:58,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,353 INFO  L93              Difference]: Finished difference Result 83 states and 154 transitions.
[2020-10-16 11:15:58,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:15:58,354 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2020-10-16 11:15:58,355 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,355 INFO  L225             Difference]: With dead ends: 83
[2020-10-16 11:15:58,355 INFO  L226             Difference]: Without dead ends: 59
[2020-10-16 11:15:58,356 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 11:15:58,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2020-10-16 11:15:58,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2020-10-16 11:15:58,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2020-10-16 11:15:58,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions.
[2020-10-16 11:15:58,361 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 9
[2020-10-16 11:15:58,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,362 INFO  L481      AbstractCegarLoop]: Abstraction has 59 states and 101 transitions.
[2020-10-16 11:15:58,362 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:15:58,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions.
[2020-10-16 11:15:58,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:15:58,363 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,363 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,363 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:15:58,363 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,363 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,364 INFO  L82        PathProgramCache]: Analyzing trace with hash 1006482721, now seen corresponding path program 1 times
[2020-10-16 11:15:58,364 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,364 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817970325]
[2020-10-16 11:15:58,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:58,499 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 11:15:58,499 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817970325]
[2020-10-16 11:15:58,500 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:58,500 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:15:58,500 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78195255]
[2020-10-16 11:15:58,500 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:15:58,501 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:58,501 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:15:58,501 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:58,501 INFO  L87              Difference]: Start difference. First operand 59 states and 101 transitions. Second operand 5 states.
[2020-10-16 11:15:58,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,534 INFO  L93              Difference]: Finished difference Result 46 states and 73 transitions.
[2020-10-16 11:15:58,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:15:58,534 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 11:15:58,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,535 INFO  L225             Difference]: With dead ends: 46
[2020-10-16 11:15:58,535 INFO  L226             Difference]: Without dead ends: 37
[2020-10-16 11:15:58,536 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 11:15:58,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2020-10-16 11:15:58,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2020-10-16 11:15:58,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2020-10-16 11:15:58,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions.
[2020-10-16 11:15:58,539 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 12
[2020-10-16 11:15:58,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,539 INFO  L481      AbstractCegarLoop]: Abstraction has 37 states and 57 transitions.
[2020-10-16 11:15:58,539 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:15:58,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions.
[2020-10-16 11:15:58,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:15:58,540 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,540 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,540 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:15:58,541 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,541 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,541 INFO  L82        PathProgramCache]: Analyzing trace with hash -1148044139, now seen corresponding path program 1 times
[2020-10-16 11:15:58,541 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,542 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146983277]
[2020-10-16 11:15:58,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:58,611 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 11:15:58,611 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146983277]
[2020-10-16 11:15:58,612 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:58,612 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:15:58,612 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378232197]
[2020-10-16 11:15:58,612 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:15:58,613 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:58,613 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:15:58,613 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:15:58,613 INFO  L87              Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 4 states.
[2020-10-16 11:15:58,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,630 INFO  L93              Difference]: Finished difference Result 48 states and 71 transitions.
[2020-10-16 11:15:58,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:15:58,631 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 11:15:58,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,631 INFO  L225             Difference]: With dead ends: 48
[2020-10-16 11:15:58,631 INFO  L226             Difference]: Without dead ends: 22
[2020-10-16 11:15:58,632 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 11:15:58,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2020-10-16 11:15:58,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2020-10-16 11:15:58,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2020-10-16 11:15:58,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions.
[2020-10-16 11:15:58,634 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15
[2020-10-16 11:15:58,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,635 INFO  L481      AbstractCegarLoop]: Abstraction has 22 states and 27 transitions.
[2020-10-16 11:15:58,635 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:15:58,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions.
[2020-10-16 11:15:58,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:15:58,635 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,636 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,636 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:15:58,636 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,636 INFO  L82        PathProgramCache]: Analyzing trace with hash 678332075, now seen corresponding path program 2 times
[2020-10-16 11:15:58,636 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,637 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302852570]
[2020-10-16 11:15:58,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:58,826 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 11:15:58,827 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302852570]
[2020-10-16 11:15:58,827 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:58,830 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:15:58,830 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271050103]
[2020-10-16 11:15:58,831 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:15:58,831 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:58,831 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:15:58,831 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:58,832 INFO  L87              Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 5 states.
[2020-10-16 11:15:58,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:58,903 INFO  L93              Difference]: Finished difference Result 28 states and 33 transitions.
[2020-10-16 11:15:58,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:15:58,903 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:15:58,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:58,904 INFO  L225             Difference]: With dead ends: 28
[2020-10-16 11:15:58,904 INFO  L226             Difference]: Without dead ends: 18
[2020-10-16 11:15:58,905 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:15:58,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2020-10-16 11:15:58,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2020-10-16 11:15:58,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2020-10-16 11:15:58,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions.
[2020-10-16 11:15:58,909 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15
[2020-10-16 11:15:58,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:58,909 INFO  L481      AbstractCegarLoop]: Abstraction has 18 states and 19 transitions.
[2020-10-16 11:15:58,909 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:15:58,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions.
[2020-10-16 11:15:58,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:15:58,910 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:58,910 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:58,910 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:15:58,910 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:58,910 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:58,911 INFO  L82        PathProgramCache]: Analyzing trace with hash -249521391, now seen corresponding path program 3 times
[2020-10-16 11:15:58,911 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:58,911 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974011751]
[2020-10-16 11:15:58,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:58,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:15:58,951 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:15:58,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:15:58,990 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:15:59,029 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:15:59,030 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:15:59,030 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:15:59,031 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:15:59,039 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L3-->L818: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In57038817 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In57038817 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In57038817 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In57038817 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_In57038817 ~y$r_buff1_thd0~0_Out57038817) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In57038817| ULTIMATE.start_assume_abort_if_not_~cond_Out57038817) (or (and (= ~y$w_buff0~0_In57038817 ~y~0_Out57038817) .cse0 .cse1) (and .cse2 (or (and (= ~y~0_In57038817 ~y~0_Out57038817) .cse3) (and .cse4 (= ~y$w_buff1~0_In57038817 ~y~0_Out57038817) .cse5)))) (= ~y$r_buff0_thd0~0_In57038817 ~y$r_buff0_thd0~0_Out57038817) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out57038817 0)) (or (and .cse0 (= ~y$w_buff0_used~0_Out57038817 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out57038817 ~y$w_buff0_used~0_In57038817))) (or (and .cse3 (= ~y$w_buff1_used~0_Out57038817 ~y$w_buff1_used~0_In57038817)) (and .cse4 .cse5 (= ~y$w_buff1_used~0_Out57038817 0))))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In57038817|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In57038817, ~y$w_buff1~0=~y$w_buff1~0_In57038817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In57038817, ~y$w_buff0~0=~y$w_buff0~0_In57038817, ~y~0=~y~0_In57038817, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In57038817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In57038817}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out57038817, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out57038817|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out57038817|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out57038817|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out57038817|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out57038817|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out57038817|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In57038817|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out57038817, ~y$w_buff1~0=~y$w_buff1~0_In57038817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out57038817, ~y$w_buff0~0=~y$w_buff0~0_In57038817, ~y~0=~y~0_Out57038817, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out57038817, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out57038817}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:15:59,044 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 11:15:59,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,046 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 11:15:59,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,046 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 11:15:59,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,046 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 11:15:59,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,047 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 11:15:59,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,047 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 11:15:59,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,047 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 11:15:59,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,048 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 11:15:59,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,048 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 11:15:59,048 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,049 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 11:15:59,049 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,049 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 11:15:59,049 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,049 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 11:15:59,049 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,050 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 11:15:59,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,050 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 11:15:59,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,050 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 11:15:59,050 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,051 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 11:15:59,051 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,051 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 11:15:59,051 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,051 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 11:15:59,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,052 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 11:15:59,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,052 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 11:15:59,052 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:59,093 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:15:59 BasicIcfg
[2020-10-16 11:15:59,093 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:15:59,095 INFO  L168              Benchmark]: Toolchain (without parser) took 7878.28 ms. Allocated memory was 140.5 MB in the beginning and 341.8 MB in the end (delta: 201.3 MB). Free memory was 102.0 MB in the beginning and 142.8 MB in the end (delta: -40.8 MB). Peak memory consumption was 160.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,096 INFO  L168              Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,097 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 770.18 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,098 INFO  L168              Benchmark]: Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,099 INFO  L168              Benchmark]: Boogie Preprocessor took 33.37 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,100 INFO  L168              Benchmark]: RCFGBuilder took 1699.79 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 151.5 MB in the beginning and 214.0 MB in the end (delta: -62.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,100 INFO  L168              Benchmark]: TraceAbstraction took 5310.41 ms. Allocated memory was 247.5 MB in the beginning and 341.8 MB in the end (delta: 94.4 MB). Free memory was 214.0 MB in the beginning and 142.8 MB in the end (delta: 71.3 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:59,108 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 770.18 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 33.37 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1699.79 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 151.5 MB in the beginning and 214.0 MB in the end (delta: -62.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 5310.41 ms. Allocated memory was 247.5 MB in the beginning and 341.8 MB in the end (delta: 94.4 MB). Free memory was 214.0 MB in the beginning and 142.8 MB in the end (delta: 71.3 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    650 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 63 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 84 PlacesBefore, 26 PlacesAfterwards, 79 TransitionsBefore, 19 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, 2114 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  int __unbuffered_p1_EAX = 0;
[L704]               0  int __unbuffered_p1_EBX = 0;
[L705]               0  _Bool main$tmp_guard0;
[L706]               0  _Bool main$tmp_guard1;
[L708]               0  int x = 0;
[L710]               0  int y = 0;
[L711]               0  _Bool y$flush_delayed;
[L712]               0  int y$mem_tmp;
[L713]               0  _Bool y$r_buff0_thd0;
[L714]               0  _Bool y$r_buff0_thd1;
[L715]               0  _Bool y$r_buff0_thd2;
[L716]               0  _Bool y$r_buff1_thd0;
[L717]               0  _Bool y$r_buff1_thd1;
[L718]               0  _Bool y$r_buff1_thd2;
[L719]               0  _Bool y$read_delayed;
[L720]               0  int *y$read_delayed_var;
[L721]               0  int y$w_buff0;
[L722]               0  _Bool y$w_buff0_used;
[L723]               0  int y$w_buff1;
[L724]               0  _Bool y$w_buff1_used;
[L726]               0  int z = 0;
[L727]               0  _Bool weak$$choice0;
[L728]               0  _Bool weak$$choice2;
[L804]               0  pthread_t t1653;
[L805]  FCALL, FORK  0  pthread_create(&t1653, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L806]               0  pthread_t t1654;
[L807]  FCALL, FORK  0  pthread_create(&t1654, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L762]               2  y$w_buff1 = y$w_buff0
[L763]               2  y$w_buff0 = 1
[L764]               2  y$w_buff1_used = y$w_buff0_used
[L765]               2  y$w_buff0_used = (_Bool)1
[L8]    COND TRUE    2  !expression
[L8]                 2  __VERIFIER_error()
[L767]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L768]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L769]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L770]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L773]               2  z = 1
[L776]               2  __unbuffered_p1_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L779]               2  __unbuffered_p1_EBX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L732]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L737]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L738]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L739]               1  y$flush_delayed = weak$$choice2
[L740]               1  y$mem_tmp = y
[L741]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L741]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L742]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L742]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L742]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0
[L742]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L742]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L742]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L743]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L743]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L743]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1
[L743]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L743]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L743]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L744]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L744]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L745]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L745]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L745]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L745]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L746]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L747]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L747]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748]               1  __unbuffered_p0_EAX = y
[L749]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L749]               1  y = y$flush_delayed ? y$mem_tmp : y
[L750]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L782]  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)
[L782]               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)
[L783]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L783]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L784]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L784]               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
[L785]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L785]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L786]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L786]               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
[L755]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L757]               1  return 0;
[L789]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L791]               2  return 0;
[L809]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L820]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 102 SDtfs, 68 SDslu, 129 SDs, 0 SdLazy, 66 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 2699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...