/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/mix029_pso.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:10:25,690 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:10:25,693 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:10:25,735 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:10:25,735 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:10:25,747 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:10:25,748 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:10:25,752 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:10:25,755 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:10:25,759 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:10:25,760 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:10:25,763 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:10:25,763 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:10:25,766 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:10:25,769 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:10:25,771 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:10:25,773 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:10:25,775 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:10:25,777 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:10:25,785 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:10:25,787 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:10:25,788 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:10:25,790 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:10:25,790 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:10:25,795 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:10:25,795 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:10:25,796 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:10:25,799 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:10:25,799 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:10:25,801 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:10:25,802 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:10:25,802 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:10:25,804 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:10:25,804 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:10:25,806 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:10:25,806 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:10:25,807 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:10:25,807 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:10:25,807 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:10:25,808 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:10:25,809 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:10:25,810 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:10:25,853 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:10:25,854 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:10:25,856 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:10:25,856 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:10:25,856 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:10:25,857 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:10:25,857 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:10:25,857 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:10:25,857 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:10:25,858 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:10:25,859 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:10:25,859 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:10:25,859 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:10:25,860 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:10:25,860 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:10:25,860 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:10:25,860 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:10:25,861 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:10:25,861 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:10:25,861 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:10:25,861 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:10:25,861 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:10:25,862 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:10:25,862 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:10:25,862 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:10:25,862 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:10:25,862 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:10:25,863 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:10:25,863 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:10:25,863 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:10:26,155 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:10:26,166 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:10:26,169 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:10:26,171 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:10:26,171 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:10:26,172 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_pso.opt.i
[2020-10-16 11:10:26,252 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d5ba7f8bc/39977bd143634d9baf769ab2455d663d/FLAG1f9cf0fc9
[2020-10-16 11:10:26,844 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:10:26,845 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix029_pso.opt.i
[2020-10-16 11:10:26,865 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d5ba7f8bc/39977bd143634d9baf769ab2455d663d/FLAG1f9cf0fc9
[2020-10-16 11:10:27,118 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d5ba7f8bc/39977bd143634d9baf769ab2455d663d
[2020-10-16 11:10:27,127 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:10:27,130 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:10:27,131 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:10:27,131 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:10:27,135 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:10:27,136 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:10:27" (1/1) ...
[2020-10-16 11:10:27,139 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a27e263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:27, skipping insertion in model container
[2020-10-16 11:10:27,139 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:10:27" (1/1) ...
[2020-10-16 11:10:27,147 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:10:27,193 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:10:27,837 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:10:27,858 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:10:27,979 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:10:28,057 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:10:28,057 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28 WrapperNode
[2020-10-16 11:10:28,058 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:10:28,059 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:10:28,059 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:10:28,059 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:10:28,069 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:10:28" (1/1) ...
[2020-10-16 11:10:28,090 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:10:28" (1/1) ...
[2020-10-16 11:10:28,133 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:10:28,134 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:10:28,134 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:10:28,134 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:10:28,143 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,143 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,148 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,149 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,160 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,165 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,169 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (1/1) ...
[2020-10-16 11:10:28,175 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:10:28,176 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:10:28,176 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:10:28,177 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:10:28,178 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (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:10:28,245 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:10:28,245 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:10:28,245 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:10:28,246 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:10:28,246 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:10:28,246 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:10:28,246 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:10:28,247 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:10:28,247 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:10:28,247 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:10:28,247 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 11:10:28,247 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 11:10:28,248 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:10:28,248 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:10:28,248 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:10:28,250 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:10:30,457 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:10:30,457 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:10:30,459 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:10:30 BoogieIcfgContainer
[2020-10-16 11:10:30,460 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:10:30,461 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:10:30,461 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:10:30,465 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:10:30,465 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:10:27" (1/3) ...
[2020-10-16 11:10:30,466 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ec472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:10:30, skipping insertion in model container
[2020-10-16 11:10:30,466 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:28" (2/3) ...
[2020-10-16 11:10:30,467 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ec472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:10:30, skipping insertion in model container
[2020-10-16 11:10:30,467 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:10:30" (3/3) ...
[2020-10-16 11:10:30,469 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix029_pso.opt.i
[2020-10-16 11:10:30,483 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:10:30,483 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:10:30,492 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:10:30,493 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:10:30,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,529 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,529 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,530 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,531 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,531 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,531 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,531 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,531 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,532 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,532 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,532 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,532 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,532 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,533 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,533 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,534 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,534 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,534 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,535 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,535 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,535 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,535 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,535 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,536 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,536 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,536 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,536 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,536 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,537 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,537 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,538 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,538 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,540 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,540 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,544 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,545 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,545 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,545 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,545 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,546 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,546 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,546 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,546 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,546 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,551 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,551 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,551 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,552 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,554 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,554 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,555 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,555 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,555 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,555 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,555 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,556 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,556 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,556 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,558 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,559 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,559 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:10:30,561 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:10:30,576 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 11:10:30,595 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:10:30,596 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:10:30,596 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:10:30,596 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:10:30,596 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:10:30,596 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:10:30,596 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:10:30,596 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:10:30,610 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:10:30,613 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 11:10:30,617 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 11:10:30,619 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-16 11:10:30,671 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-16 11:10:30,671 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:10:30,678 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 11:10:30,682 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-16 11:10:30,833 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:30,834 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:30,837 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:30,838 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:30,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:30,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:30,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:30,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:30,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:30,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:30,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:30,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:30,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:30,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,002 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,006 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,014 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,015 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,017 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,018 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,020 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,020 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,090 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:31,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:10:31,098 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,098 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,218 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:31,222 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:10:31,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:31,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:31,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,284 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,290 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,299 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,299 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,301 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,301 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,376 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,380 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:31,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:10:31,383 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,432 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:31,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:31,435 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,435 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,437 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,437 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,443 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,445 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:31,445 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:31,447 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:31,448 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,597 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,598 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,599 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,599 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,624 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,625 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,626 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,658 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,688 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,689 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,712 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,712 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,713 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,714 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,733 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,734 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,735 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,784 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,813 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,838 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:31,838 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:31,839 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:31,839 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,309 WARN  L193               SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:10:32,418 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:10:32,441 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,442 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:32,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 11:10:32,443 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:32,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:32,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,550 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:32,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,619 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:32,619 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:32,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:32,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:32,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,676 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:32,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:32,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:32,682 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:32,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:32,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:32,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:32,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:32,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,690 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,692 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,692 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,731 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:32,732 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,733 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:32,733 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:32,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:32,736 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:10:32,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:32,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:34,085 WARN  L193               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-16 11:10:34,093 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-16 11:10:34,093 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:34,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:34,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,005 WARN  L193               SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-16 11:10:35,027 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:35,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,028 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:35,028 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:35,047 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 11:10:35,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:35,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,112 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:35,118 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,120 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:35,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:35,123 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,176 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:10:35,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:10:35,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,180 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:10:35,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:10:35,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,428 WARN  L193               SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-16 11:10:35,624 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,625 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,626 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:35,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,627 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,629 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,630 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,631 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,632 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,635 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,638 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,638 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,666 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,666 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,780 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:35,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,782 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:35,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,785 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,788 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,788 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:35,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:35,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:35,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:35,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,009 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:36,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,013 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,015 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,015 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,016 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,017 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,017 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,018 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,019 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,019 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,107 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:36,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,110 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,111 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,111 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,116 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,118 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:36,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,315 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:36,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,318 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,324 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,324 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,326 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,342 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:36,345 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,347 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,612 WARN  L193               SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:10:36,842 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,842 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:10:36,844 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,845 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:10:36,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,865 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,865 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:36,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:10:36,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:36,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:36,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:38,005 WARN  L193               SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110
[2020-10-16 11:10:38,298 WARN  L193               SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-10-16 11:10:38,693 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 11:10:38,815 WARN  L193               SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 11:10:39,983 WARN  L193               SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 146 DAG size of output: 137
[2020-10-16 11:10:40,513 WARN  L193               SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 11:10:40,519 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:10:40,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,573 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:10:40,573 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,661 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,662 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,662 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,664 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,665 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:40,669 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:40,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,689 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,689 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,692 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:10:40,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,695 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:10:40,732 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:10:40,732 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,768 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,769 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,771 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:10:40,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,773 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:10:40,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,815 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,815 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:40,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:10:40,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:40,820 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:10:40,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:10:40,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:10:40,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:10:41,125 WARN  L193               SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 11:10:41,259 WARN  L193               SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 11:10:41,329 INFO  L132        LiptonReduction]: Checked pairs total: 7948
[2020-10-16 11:10:41,329 INFO  L134        LiptonReduction]: Total number of compositions: 91
[2020-10-16 11:10:41,336 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-16 11:10:41,646 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-16 11:10:41,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-16 11:10:41,655 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:10:41,655 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:41,656 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:41,657 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:41,663 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:41,663 INFO  L82        PathProgramCache]: Analyzing trace with hash 51217073, now seen corresponding path program 1 times
[2020-10-16 11:10:41,673 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:41,674 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874358418]
[2020-10-16 11:10:41,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:41,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:41,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:10:41,937 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874358418]
[2020-10-16 11:10:41,938 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:41,938 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:41,939 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757361159]
[2020-10-16 11:10:41,943 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:41,944 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:41,966 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:41,967 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:41,969 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-16 11:10:42,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:42,132 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-16 11:10:42,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:42,134 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:10:42,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:42,186 INFO  L225             Difference]: With dead ends: 3250
[2020-10-16 11:10:42,186 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-16 11:10:42,188 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:10:42,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-16 11:10:42,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-16 11:10:42,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-16 11:10:42,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-16 11:10:42,435 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-16 11:10:42,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:42,436 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-16 11:10:42,436 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:42,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-16 11:10:42,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:10:42,442 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:42,442 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:42,442 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:10:42,442 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:42,443 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:42,443 INFO  L82        PathProgramCache]: Analyzing trace with hash -386244636, now seen corresponding path program 1 times
[2020-10-16 11:10:42,443 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:42,444 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181408657]
[2020-10-16 11:10:42,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:42,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:42,567 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:10:42,568 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181408657]
[2020-10-16 11:10:42,569 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:42,569 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:42,570 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518185863]
[2020-10-16 11:10:42,571 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:42,571 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:42,572 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:42,572 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:42,572 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-16 11:10:42,652 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:42,652 INFO  L93              Difference]: Finished difference Result 2630 states and 10137 transitions.
[2020-10-16 11:10:42,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:42,654 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:10:42,654 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:42,679 INFO  L225             Difference]: With dead ends: 2630
[2020-10-16 11:10:42,679 INFO  L226             Difference]: Without dead ends: 2630
[2020-10-16 11:10:42,680 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:10:42,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2630 states.
[2020-10-16 11:10:42,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630.
[2020-10-16 11:10:42,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2630 states.
[2020-10-16 11:10:42,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10137 transitions.
[2020-10-16 11:10:42,883 INFO  L78                 Accepts]: Start accepts. Automaton has 2630 states and 10137 transitions. Word has length 11
[2020-10-16 11:10:42,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:42,883 INFO  L481      AbstractCegarLoop]: Abstraction has 2630 states and 10137 transitions.
[2020-10-16 11:10:42,883 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:42,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 2630 states and 10137 transitions.
[2020-10-16 11:10:42,895 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:10:42,896 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:42,896 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:42,896 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:10:42,897 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:42,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:42,898 INFO  L82        PathProgramCache]: Analyzing trace with hash 951098663, now seen corresponding path program 1 times
[2020-10-16 11:10:42,898 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:42,898 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172622041]
[2020-10-16 11:10:42,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:42,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:43,004 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:10:43,005 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172622041]
[2020-10-16 11:10:43,006 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:43,006 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:43,006 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215897435]
[2020-10-16 11:10:43,007 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:43,007 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:43,007 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:43,008 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:43,008 INFO  L87              Difference]: Start difference. First operand 2630 states and 10137 transitions. Second operand 3 states.
[2020-10-16 11:10:43,066 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:43,067 INFO  L93              Difference]: Finished difference Result 2610 states and 10046 transitions.
[2020-10-16 11:10:43,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:43,069 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:10:43,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:43,100 INFO  L225             Difference]: With dead ends: 2610
[2020-10-16 11:10:43,100 INFO  L226             Difference]: Without dead ends: 2610
[2020-10-16 11:10:43,101 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:10:43,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2610 states.
[2020-10-16 11:10:43,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610.
[2020-10-16 11:10:43,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2610 states.
[2020-10-16 11:10:43,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions.
[2020-10-16 11:10:43,229 INFO  L78                 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 12
[2020-10-16 11:10:43,230 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:43,230 INFO  L481      AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions.
[2020-10-16 11:10:43,230 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:43,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions.
[2020-10-16 11:10:43,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:10:43,232 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:43,232 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:43,232 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:10:43,233 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:43,233 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:43,233 INFO  L82        PathProgramCache]: Analyzing trace with hash 910702067, now seen corresponding path program 1 times
[2020-10-16 11:10:43,233 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:43,234 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542461990]
[2020-10-16 11:10:43,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:43,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:43,352 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:10:43,353 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542461990]
[2020-10-16 11:10:43,353 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:43,354 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:43,354 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676067430]
[2020-10-16 11:10:43,355 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:43,355 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:43,355 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:43,355 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:43,355 INFO  L87              Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states.
[2020-10-16 11:10:43,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:43,427 INFO  L93              Difference]: Finished difference Result 2590 states and 9955 transitions.
[2020-10-16 11:10:43,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:43,428 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:10:43,428 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:43,452 INFO  L225             Difference]: With dead ends: 2590
[2020-10-16 11:10:43,453 INFO  L226             Difference]: Without dead ends: 2590
[2020-10-16 11:10:43,453 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:10:43,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2590 states.
[2020-10-16 11:10:43,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590.
[2020-10-16 11:10:43,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2590 states.
[2020-10-16 11:10:43,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9955 transitions.
[2020-10-16 11:10:43,595 INFO  L78                 Accepts]: Start accepts. Automaton has 2590 states and 9955 transitions. Word has length 12
[2020-10-16 11:10:43,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:43,595 INFO  L481      AbstractCegarLoop]: Abstraction has 2590 states and 9955 transitions.
[2020-10-16 11:10:43,596 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:43,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 2590 states and 9955 transitions.
[2020-10-16 11:10:43,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:10:43,599 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:43,599 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:43,600 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:10:43,600 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:43,600 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:43,601 INFO  L82        PathProgramCache]: Analyzing trace with hash -581328624, now seen corresponding path program 1 times
[2020-10-16 11:10:43,601 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:43,601 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605648552]
[2020-10-16 11:10:43,601 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:43,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:43,708 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:10:43,709 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605648552]
[2020-10-16 11:10:43,709 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:43,709 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:43,710 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992486606]
[2020-10-16 11:10:43,711 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:43,712 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:43,712 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:43,712 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:43,713 INFO  L87              Difference]: Start difference. First operand 2590 states and 9955 transitions. Second operand 3 states.
[2020-10-16 11:10:43,765 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:43,765 INFO  L93              Difference]: Finished difference Result 2450 states and 9358 transitions.
[2020-10-16 11:10:43,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:43,767 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 11:10:43,767 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:43,803 INFO  L225             Difference]: With dead ends: 2450
[2020-10-16 11:10:43,803 INFO  L226             Difference]: Without dead ends: 2450
[2020-10-16 11:10:43,804 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:10:43,832 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2450 states.
[2020-10-16 11:10:43,926 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450.
[2020-10-16 11:10:43,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2450 states.
[2020-10-16 11:10:43,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions.
[2020-10-16 11:10:43,954 INFO  L78                 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 13
[2020-10-16 11:10:43,954 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:43,954 INFO  L481      AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions.
[2020-10-16 11:10:43,954 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:43,955 INFO  L276                IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions.
[2020-10-16 11:10:43,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:10:43,957 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:43,958 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:43,958 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:10:43,958 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:43,958 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:43,959 INFO  L82        PathProgramCache]: Analyzing trace with hash -1834993486, now seen corresponding path program 1 times
[2020-10-16 11:10:43,959 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:43,959 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95031027]
[2020-10-16 11:10:43,959 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:43,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:44,025 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:10:44,026 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95031027]
[2020-10-16 11:10:44,026 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:44,026 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:10:44,027 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847261577]
[2020-10-16 11:10:44,027 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:10:44,027 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:44,028 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:10:44,028 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:44,028 INFO  L87              Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states.
[2020-10-16 11:10:44,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:44,098 INFO  L93              Difference]: Finished difference Result 2418 states and 9214 transitions.
[2020-10-16 11:10:44,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:10:44,100 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 11:10:44,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:44,114 INFO  L225             Difference]: With dead ends: 2418
[2020-10-16 11:10:44,115 INFO  L226             Difference]: Without dead ends: 2418
[2020-10-16 11:10:44,115 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:10:44,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2418 states.
[2020-10-16 11:10:44,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418.
[2020-10-16 11:10:44,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2418 states.
[2020-10-16 11:10:44,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions.
[2020-10-16 11:10:44,213 INFO  L78                 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 13
[2020-10-16 11:10:44,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:44,214 INFO  L481      AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions.
[2020-10-16 11:10:44,214 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:10:44,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions.
[2020-10-16 11:10:44,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:10:44,217 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:44,217 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:44,217 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:10:44,218 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:44,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:44,218 INFO  L82        PathProgramCache]: Analyzing trace with hash -843304651, now seen corresponding path program 1 times
[2020-10-16 11:10:44,218 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:44,219 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468226696]
[2020-10-16 11:10:44,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:44,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:44,409 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9
[2020-10-16 11:10:44,485 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:10:44,486 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468226696]
[2020-10-16 11:10:44,486 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:44,486 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:44,486 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660570003]
[2020-10-16 11:10:44,487 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:10:44,487 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:44,488 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:10:44,489 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:44,489 INFO  L87              Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 5 states.
[2020-10-16 11:10:44,612 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:44,612 INFO  L93              Difference]: Finished difference Result 2482 states and 9438 transitions.
[2020-10-16 11:10:44,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:10:44,614 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 11:10:44,614 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:44,625 INFO  L225             Difference]: With dead ends: 2482
[2020-10-16 11:10:44,626 INFO  L226             Difference]: Without dead ends: 2482
[2020-10-16 11:10:44,626 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:44,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2482 states.
[2020-10-16 11:10:44,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2482.
[2020-10-16 11:10:44,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2482 states.
[2020-10-16 11:10:44,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9438 transitions.
[2020-10-16 11:10:44,721 INFO  L78                 Accepts]: Start accepts. Automaton has 2482 states and 9438 transitions. Word has length 14
[2020-10-16 11:10:44,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:44,721 INFO  L481      AbstractCegarLoop]: Abstraction has 2482 states and 9438 transitions.
[2020-10-16 11:10:44,722 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:10:44,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 2482 states and 9438 transitions.
[2020-10-16 11:10:44,725 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:10:44,725 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:44,725 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:44,725 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:10:44,726 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:44,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:44,726 INFO  L82        PathProgramCache]: Analyzing trace with hash 1476424878, now seen corresponding path program 1 times
[2020-10-16 11:10:44,726 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:44,727 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987437063]
[2020-10-16 11:10:44,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:44,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:44,869 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:10:44,870 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987437063]
[2020-10-16 11:10:44,870 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:44,870 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:44,870 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587612713]
[2020-10-16 11:10:44,871 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:10:44,871 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:44,871 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:10:44,872 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:44,872 INFO  L87              Difference]: Start difference. First operand 2482 states and 9438 transitions. Second operand 5 states.
[2020-10-16 11:10:44,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:44,970 INFO  L93              Difference]: Finished difference Result 2498 states and 9494 transitions.
[2020-10-16 11:10:44,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:10:44,972 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:10:44,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:44,984 INFO  L225             Difference]: With dead ends: 2498
[2020-10-16 11:10:44,984 INFO  L226             Difference]: Without dead ends: 2498
[2020-10-16 11:10:44,985 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:44,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2498 states.
[2020-10-16 11:10:45,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498.
[2020-10-16 11:10:45,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2498 states.
[2020-10-16 11:10:45,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9494 transitions.
[2020-10-16 11:10:45,067 INFO  L78                 Accepts]: Start accepts. Automaton has 2498 states and 9494 transitions. Word has length 15
[2020-10-16 11:10:45,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:45,068 INFO  L481      AbstractCegarLoop]: Abstraction has 2498 states and 9494 transitions.
[2020-10-16 11:10:45,068 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:10:45,068 INFO  L276                IsEmpty]: Start isEmpty. Operand 2498 states and 9494 transitions.
[2020-10-16 11:10:45,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:45,072 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:45,072 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:45,072 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:10:45,073 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:45,073 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:45,073 INFO  L82        PathProgramCache]: Analyzing trace with hash -326164469, now seen corresponding path program 1 times
[2020-10-16 11:10:45,073 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:45,073 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483281674]
[2020-10-16 11:10:45,074 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:45,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:45,242 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:10:45,242 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483281674]
[2020-10-16 11:10:45,242 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:45,242 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:45,243 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644657688]
[2020-10-16 11:10:45,243 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:45,243 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:45,244 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:45,244 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:45,245 INFO  L87              Difference]: Start difference. First operand 2498 states and 9494 transitions. Second operand 6 states.
[2020-10-16 11:10:45,427 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:45,427 INFO  L93              Difference]: Finished difference Result 2562 states and 9686 transitions.
[2020-10-16 11:10:45,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:45,428 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:10:45,429 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:45,441 INFO  L225             Difference]: With dead ends: 2562
[2020-10-16 11:10:45,441 INFO  L226             Difference]: Without dead ends: 2562
[2020-10-16 11:10:45,441 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:10:45,454 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2562 states.
[2020-10-16 11:10:45,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2434.
[2020-10-16 11:10:45,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2434 states.
[2020-10-16 11:10:45,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions.
[2020-10-16 11:10:45,540 INFO  L78                 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 16
[2020-10-16 11:10:45,541 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:45,541 INFO  L481      AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions.
[2020-10-16 11:10:45,541 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:45,541 INFO  L276                IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions.
[2020-10-16 11:10:45,546 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:45,546 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:45,546 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:45,546 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:10:45,547 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:45,547 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:45,547 INFO  L82        PathProgramCache]: Analyzing trace with hash -1268550471, now seen corresponding path program 1 times
[2020-10-16 11:10:45,548 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:45,548 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822582069]
[2020-10-16 11:10:45,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:45,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:45,746 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:10:45,746 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822582069]
[2020-10-16 11:10:45,746 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:45,747 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:45,747 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278119007]
[2020-10-16 11:10:45,747 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:45,748 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:45,748 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:45,748 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:45,748 INFO  L87              Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 6 states.
[2020-10-16 11:10:45,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:45,872 INFO  L93              Difference]: Finished difference Result 2634 states and 10064 transitions.
[2020-10-16 11:10:45,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:45,873 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:10:45,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:45,884 INFO  L225             Difference]: With dead ends: 2634
[2020-10-16 11:10:45,884 INFO  L226             Difference]: Without dead ends: 2634
[2020-10-16 11:10:45,884 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:45,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2634 states.
[2020-10-16 11:10:45,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634.
[2020-10-16 11:10:45,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2634 states.
[2020-10-16 11:10:45,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10064 transitions.
[2020-10-16 11:10:45,969 INFO  L78                 Accepts]: Start accepts. Automaton has 2634 states and 10064 transitions. Word has length 16
[2020-10-16 11:10:45,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:45,969 INFO  L481      AbstractCegarLoop]: Abstraction has 2634 states and 10064 transitions.
[2020-10-16 11:10:45,969 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:45,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 2634 states and 10064 transitions.
[2020-10-16 11:10:45,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:45,974 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:45,974 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:45,975 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:10:45,975 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:45,975 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:45,975 INFO  L82        PathProgramCache]: Analyzing trace with hash -1475469297, now seen corresponding path program 2 times
[2020-10-16 11:10:45,975 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:45,976 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628470133]
[2020-10-16 11:10:45,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:45,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:46,270 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:10:46,271 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628470133]
[2020-10-16 11:10:46,272 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:46,272 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:46,272 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675831975]
[2020-10-16 11:10:46,272 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:46,272 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:46,273 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:46,273 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:46,273 INFO  L87              Difference]: Start difference. First operand 2634 states and 10064 transitions. Second operand 6 states.
[2020-10-16 11:10:46,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:46,374 INFO  L93              Difference]: Finished difference Result 2690 states and 10262 transitions.
[2020-10-16 11:10:46,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:46,379 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:10:46,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:46,389 INFO  L225             Difference]: With dead ends: 2690
[2020-10-16 11:10:46,389 INFO  L226             Difference]: Without dead ends: 2690
[2020-10-16 11:10:46,389 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:46,402 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2690 states.
[2020-10-16 11:10:46,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2618.
[2020-10-16 11:10:46,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2618 states.
[2020-10-16 11:10:46,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 10004 transitions.
[2020-10-16 11:10:46,481 INFO  L78                 Accepts]: Start accepts. Automaton has 2618 states and 10004 transitions. Word has length 16
[2020-10-16 11:10:46,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:46,481 INFO  L481      AbstractCegarLoop]: Abstraction has 2618 states and 10004 transitions.
[2020-10-16 11:10:46,482 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:46,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 2618 states and 10004 transitions.
[2020-10-16 11:10:46,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:46,487 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:46,487 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:46,487 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:10:46,487 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:46,487 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:46,487 INFO  L82        PathProgramCache]: Analyzing trace with hash -1547901303, now seen corresponding path program 3 times
[2020-10-16 11:10:46,488 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:46,488 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461057233]
[2020-10-16 11:10:46,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:46,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:46,668 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:10:46,668 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461057233]
[2020-10-16 11:10:46,669 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:46,669 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:46,669 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032084188]
[2020-10-16 11:10:46,669 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:46,669 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:46,670 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:46,670 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:46,670 INFO  L87              Difference]: Start difference. First operand 2618 states and 10004 transitions. Second operand 6 states.
[2020-10-16 11:10:46,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:46,812 INFO  L93              Difference]: Finished difference Result 2858 states and 10856 transitions.
[2020-10-16 11:10:46,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:46,813 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:10:46,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:46,823 INFO  L225             Difference]: With dead ends: 2858
[2020-10-16 11:10:46,823 INFO  L226             Difference]: Without dead ends: 2858
[2020-10-16 11:10:46,823 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:46,837 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2858 states.
[2020-10-16 11:10:46,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2650.
[2020-10-16 11:10:46,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-16 11:10:46,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10036 transitions.
[2020-10-16 11:10:46,915 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10036 transitions. Word has length 16
[2020-10-16 11:10:46,915 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:46,915 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10036 transitions.
[2020-10-16 11:10:46,916 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:46,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10036 transitions.
[2020-10-16 11:10:46,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:46,921 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:46,921 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:46,922 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:10:46,922 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:46,922 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:46,922 INFO  L82        PathProgramCache]: Analyzing trace with hash 1272309844, now seen corresponding path program 1 times
[2020-10-16 11:10:46,923 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:46,923 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700831156]
[2020-10-16 11:10:46,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:46,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:47,152 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:10:47,152 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700831156]
[2020-10-16 11:10:47,153 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:47,153 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:47,153 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968283131]
[2020-10-16 11:10:47,154 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:47,154 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:47,154 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:47,155 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:47,155 INFO  L87              Difference]: Start difference. First operand 2650 states and 10036 transitions. Second operand 6 states.
[2020-10-16 11:10:47,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:47,270 INFO  L93              Difference]: Finished difference Result 2778 states and 10572 transitions.
[2020-10-16 11:10:47,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:47,271 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:10:47,272 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:47,278 INFO  L225             Difference]: With dead ends: 2778
[2020-10-16 11:10:47,279 INFO  L226             Difference]: Without dead ends: 2778
[2020-10-16 11:10:47,279 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:10:47,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2778 states.
[2020-10-16 11:10:47,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2522.
[2020-10-16 11:10:47,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2522 states.
[2020-10-16 11:10:47,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 9524 transitions.
[2020-10-16 11:10:47,357 INFO  L78                 Accepts]: Start accepts. Automaton has 2522 states and 9524 transitions. Word has length 16
[2020-10-16 11:10:47,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:47,358 INFO  L481      AbstractCegarLoop]: Abstraction has 2522 states and 9524 transitions.
[2020-10-16 11:10:47,358 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:47,358 INFO  L276                IsEmpty]: Start isEmpty. Operand 2522 states and 9524 transitions.
[2020-10-16 11:10:47,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:47,362 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:47,362 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:47,362 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:10:47,363 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:47,363 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:47,363 INFO  L82        PathProgramCache]: Analyzing trace with hash 1332982548, now seen corresponding path program 1 times
[2020-10-16 11:10:47,363 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:47,363 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591669496]
[2020-10-16 11:10:47,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:47,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:47,436 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:10:47,437 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591669496]
[2020-10-16 11:10:47,437 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:47,437 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:47,437 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066516306]
[2020-10-16 11:10:47,438 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:10:47,438 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:47,438 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:10:47,438 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:47,439 INFO  L87              Difference]: Start difference. First operand 2522 states and 9524 transitions. Second operand 5 states.
[2020-10-16 11:10:47,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:47,535 INFO  L93              Difference]: Finished difference Result 3686 states and 13705 transitions.
[2020-10-16 11:10:47,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:47,536 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 11:10:47,536 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:47,558 INFO  L225             Difference]: With dead ends: 3686
[2020-10-16 11:10:47,559 INFO  L226             Difference]: Without dead ends: 2642
[2020-10-16 11:10:47,560 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:47,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2642 states.
[2020-10-16 11:10:47,624 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2522.
[2020-10-16 11:10:47,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2522 states.
[2020-10-16 11:10:47,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 9200 transitions.
[2020-10-16 11:10:47,634 INFO  L78                 Accepts]: Start accepts. Automaton has 2522 states and 9200 transitions. Word has length 16
[2020-10-16 11:10:47,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:47,634 INFO  L481      AbstractCegarLoop]: Abstraction has 2522 states and 9200 transitions.
[2020-10-16 11:10:47,634 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:10:47,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 2522 states and 9200 transitions.
[2020-10-16 11:10:47,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:10:47,639 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:47,639 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:47,639 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 11:10:47,639 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:47,640 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:47,640 INFO  L82        PathProgramCache]: Analyzing trace with hash 58923448, now seen corresponding path program 2 times
[2020-10-16 11:10:47,640 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:47,640 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295291776]
[2020-10-16 11:10:47,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:47,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:47,765 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:10:47,766 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295291776]
[2020-10-16 11:10:47,766 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:47,766 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:47,766 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914326546]
[2020-10-16 11:10:47,767 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:10:47,767 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:47,767 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:10:47,767 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:10:47,767 INFO  L87              Difference]: Start difference. First operand 2522 states and 9200 transitions. Second operand 4 states.
[2020-10-16 11:10:47,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:47,893 INFO  L93              Difference]: Finished difference Result 2606 states and 8654 transitions.
[2020-10-16 11:10:47,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:10:47,893 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-16 11:10:47,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:47,900 INFO  L225             Difference]: With dead ends: 2606
[2020-10-16 11:10:47,900 INFO  L226             Difference]: Without dead ends: 1934
[2020-10-16 11:10:47,902 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:10:47,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1934 states.
[2020-10-16 11:10:47,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934.
[2020-10-16 11:10:47,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1934 states.
[2020-10-16 11:10:47,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 6362 transitions.
[2020-10-16 11:10:47,957 INFO  L78                 Accepts]: Start accepts. Automaton has 1934 states and 6362 transitions. Word has length 16
[2020-10-16 11:10:47,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:47,958 INFO  L481      AbstractCegarLoop]: Abstraction has 1934 states and 6362 transitions.
[2020-10-16 11:10:47,958 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:10:47,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 1934 states and 6362 transitions.
[2020-10-16 11:10:47,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:10:47,962 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:47,963 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:47,963 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 11:10:47,963 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:47,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:47,963 INFO  L82        PathProgramCache]: Analyzing trace with hash 689820000, now seen corresponding path program 1 times
[2020-10-16 11:10:47,964 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:47,964 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761595111]
[2020-10-16 11:10:47,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:48,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:48,087 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:10:48,088 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761595111]
[2020-10-16 11:10:48,088 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:48,088 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:48,088 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657037520]
[2020-10-16 11:10:48,089 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:10:48,089 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:48,090 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:10:48,090 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:48,090 INFO  L87              Difference]: Start difference. First operand 1934 states and 6362 transitions. Second operand 5 states.
[2020-10-16 11:10:48,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:48,148 INFO  L93              Difference]: Finished difference Result 1669 states and 5064 transitions.
[2020-10-16 11:10:48,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:10:48,149 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:10:48,149 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:48,153 INFO  L225             Difference]: With dead ends: 1669
[2020-10-16 11:10:48,153 INFO  L226             Difference]: Without dead ends: 1261
[2020-10-16 11:10:48,153 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:10:48,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1261 states.
[2020-10-16 11:10:48,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261.
[2020-10-16 11:10:48,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1261 states.
[2020-10-16 11:10:48,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3758 transitions.
[2020-10-16 11:10:48,184 INFO  L78                 Accepts]: Start accepts. Automaton has 1261 states and 3758 transitions. Word has length 17
[2020-10-16 11:10:48,185 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:48,185 INFO  L481      AbstractCegarLoop]: Abstraction has 1261 states and 3758 transitions.
[2020-10-16 11:10:48,185 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:10:48,185 INFO  L276                IsEmpty]: Start isEmpty. Operand 1261 states and 3758 transitions.
[2020-10-16 11:10:48,188 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:10:48,188 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:48,189 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:48,189 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 11:10:48,189 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:48,189 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:48,189 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602746911, now seen corresponding path program 1 times
[2020-10-16 11:10:48,190 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:48,190 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957171619]
[2020-10-16 11:10:48,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:48,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:48,302 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:10:48,302 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957171619]
[2020-10-16 11:10:48,303 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:48,303 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:10:48,303 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559919213]
[2020-10-16 11:10:48,303 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:48,304 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:48,304 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:48,307 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:48,307 INFO  L87              Difference]: Start difference. First operand 1261 states and 3758 transitions. Second operand 6 states.
[2020-10-16 11:10:48,376 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:48,376 INFO  L93              Difference]: Finished difference Result 1113 states and 3288 transitions.
[2020-10-16 11:10:48,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:10:48,377 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-16 11:10:48,377 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:48,380 INFO  L225             Difference]: With dead ends: 1113
[2020-10-16 11:10:48,381 INFO  L226             Difference]: Without dead ends: 988
[2020-10-16 11:10:48,382 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:10:48,386 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 988 states.
[2020-10-16 11:10:48,400 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 916.
[2020-10-16 11:10:48,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 916 states.
[2020-10-16 11:10:48,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2737 transitions.
[2020-10-16 11:10:48,403 INFO  L78                 Accepts]: Start accepts. Automaton has 916 states and 2737 transitions. Word has length 20
[2020-10-16 11:10:48,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:48,404 INFO  L481      AbstractCegarLoop]: Abstraction has 916 states and 2737 transitions.
[2020-10-16 11:10:48,404 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:48,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 916 states and 2737 transitions.
[2020-10-16 11:10:48,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:10:48,410 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:48,410 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:48,410 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 11:10:48,411 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:48,411 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:48,411 INFO  L82        PathProgramCache]: Analyzing trace with hash 1246512088, now seen corresponding path program 1 times
[2020-10-16 11:10:48,411 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:48,413 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988158090]
[2020-10-16 11:10:48,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:48,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:48,514 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:10:48,515 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988158090]
[2020-10-16 11:10:48,515 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:48,515 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:10:48,516 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157731800]
[2020-10-16 11:10:48,517 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:10:48,518 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:48,518 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:10:48,518 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:10:48,518 INFO  L87              Difference]: Start difference. First operand 916 states and 2737 transitions. Second operand 6 states.
[2020-10-16 11:10:48,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:48,670 INFO  L93              Difference]: Finished difference Result 1495 states and 4344 transitions.
[2020-10-16 11:10:48,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:10:48,671 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2020-10-16 11:10:48,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:48,676 INFO  L225             Difference]: With dead ends: 1495
[2020-10-16 11:10:48,676 INFO  L226             Difference]: Without dead ends: 1247
[2020-10-16 11:10:48,676 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:10:48,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1247 states.
[2020-10-16 11:10:48,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1192.
[2020-10-16 11:10:48,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1192 states.
[2020-10-16 11:10:48,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3519 transitions.
[2020-10-16 11:10:48,704 INFO  L78                 Accepts]: Start accepts. Automaton has 1192 states and 3519 transitions. Word has length 23
[2020-10-16 11:10:48,704 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:48,704 INFO  L481      AbstractCegarLoop]: Abstraction has 1192 states and 3519 transitions.
[2020-10-16 11:10:48,704 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:10:48,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 1192 states and 3519 transitions.
[2020-10-16 11:10:48,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:10:48,707 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:48,708 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:48,708 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 11:10:48,708 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:48,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:48,709 INFO  L82        PathProgramCache]: Analyzing trace with hash 736320564, now seen corresponding path program 2 times
[2020-10-16 11:10:48,709 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:48,709 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256931981]
[2020-10-16 11:10:48,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:48,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:48,772 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:10:48,773 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256931981]
[2020-10-16 11:10:48,773 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:48,773 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:48,774 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113415800]
[2020-10-16 11:10:48,774 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:10:48,774 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:48,774 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:10:48,775 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:10:48,775 INFO  L87              Difference]: Start difference. First operand 1192 states and 3519 transitions. Second operand 4 states.
[2020-10-16 11:10:48,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:48,799 INFO  L93              Difference]: Finished difference Result 1460 states and 4220 transitions.
[2020-10-16 11:10:48,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:10:48,800 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-10-16 11:10:48,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:48,804 INFO  L225             Difference]: With dead ends: 1460
[2020-10-16 11:10:48,805 INFO  L226             Difference]: Without dead ends: 1135
[2020-10-16 11:10:48,805 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:10:48,809 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1135 states.
[2020-10-16 11:10:48,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 856.
[2020-10-16 11:10:48,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 856 states.
[2020-10-16 11:10:48,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2462 transitions.
[2020-10-16 11:10:48,826 INFO  L78                 Accepts]: Start accepts. Automaton has 856 states and 2462 transitions. Word has length 23
[2020-10-16 11:10:48,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:48,828 INFO  L481      AbstractCegarLoop]: Abstraction has 856 states and 2462 transitions.
[2020-10-16 11:10:48,828 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:10:48,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 856 states and 2462 transitions.
[2020-10-16 11:10:48,830 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:10:48,830 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:48,831 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:48,831 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 11:10:48,831 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:48,831 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:48,831 INFO  L82        PathProgramCache]: Analyzing trace with hash 669029708, now seen corresponding path program 3 times
[2020-10-16 11:10:48,831 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:48,832 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755893766]
[2020-10-16 11:10:48,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:48,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:48,969 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:10:48,970 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755893766]
[2020-10-16 11:10:48,970 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:48,970 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:10:48,970 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539727877]
[2020-10-16 11:10:48,971 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:10:48,971 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:48,971 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:10:48,971 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:10:48,971 INFO  L87              Difference]: Start difference. First operand 856 states and 2462 transitions. Second operand 7 states.
[2020-10-16 11:10:49,045 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:49,046 INFO  L93              Difference]: Finished difference Result 827 states and 2404 transitions.
[2020-10-16 11:10:49,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:10:49,047 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2020-10-16 11:10:49,047 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:49,048 INFO  L225             Difference]: With dead ends: 827
[2020-10-16 11:10:49,048 INFO  L226             Difference]: Without dead ends: 318
[2020-10-16 11:10:49,048 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:10:49,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2020-10-16 11:10:49,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 302.
[2020-10-16 11:10:49,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 11:10:49,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 803 transitions.
[2020-10-16 11:10:49,055 INFO  L78                 Accepts]: Start accepts. Automaton has 302 states and 803 transitions. Word has length 23
[2020-10-16 11:10:49,055 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:49,056 INFO  L481      AbstractCegarLoop]: Abstraction has 302 states and 803 transitions.
[2020-10-16 11:10:49,056 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:10:49,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 302 states and 803 transitions.
[2020-10-16 11:10:49,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 11:10:49,058 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:49,058 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:49,058 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 11:10:49,059 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:49,059 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:49,059 INFO  L82        PathProgramCache]: Analyzing trace with hash -1639471165, now seen corresponding path program 1 times
[2020-10-16 11:10:49,059 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:49,059 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763108342]
[2020-10-16 11:10:49,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:49,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:49,130 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:10:49,130 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763108342]
[2020-10-16 11:10:49,130 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:49,130 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:10:49,131 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965417016]
[2020-10-16 11:10:49,131 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:10:49,131 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:49,131 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:10:49,131 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:10:49,132 INFO  L87              Difference]: Start difference. First operand 302 states and 803 transitions. Second operand 4 states.
[2020-10-16 11:10:49,150 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:49,150 INFO  L93              Difference]: Finished difference Result 376 states and 991 transitions.
[2020-10-16 11:10:49,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:10:49,151 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 27
[2020-10-16 11:10:49,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:49,152 INFO  L225             Difference]: With dead ends: 376
[2020-10-16 11:10:49,152 INFO  L226             Difference]: Without dead ends: 138
[2020-10-16 11:10:49,152 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:10:49,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-16 11:10:49,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2020-10-16 11:10:49,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2020-10-16 11:10:49,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions.
[2020-10-16 11:10:49,156 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27
[2020-10-16 11:10:49,156 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:49,156 INFO  L481      AbstractCegarLoop]: Abstraction has 138 states and 323 transitions.
[2020-10-16 11:10:49,156 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:10:49,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions.
[2020-10-16 11:10:49,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 11:10:49,157 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:49,157 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:49,157 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-16 11:10:49,157 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:49,158 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:49,158 INFO  L82        PathProgramCache]: Analyzing trace with hash 1076556023, now seen corresponding path program 2 times
[2020-10-16 11:10:49,158 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:49,158 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228556217]
[2020-10-16 11:10:49,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:49,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:10:49,813 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:10:49,813 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228556217]
[2020-10-16 11:10:49,814 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:10:49,814 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:10:49,814 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690365479]
[2020-10-16 11:10:49,814 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:10:49,814 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:10:49,815 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:10:49,815 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:10:49,815 INFO  L87              Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 9 states.
[2020-10-16 11:10:50,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:10:50,011 INFO  L93              Difference]: Finished difference Result 176 states and 409 transitions.
[2020-10-16 11:10:50,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:10:50,012 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 27
[2020-10-16 11:10:50,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:10:50,013 INFO  L225             Difference]: With dead ends: 176
[2020-10-16 11:10:50,013 INFO  L226             Difference]: Without dead ends: 92
[2020-10-16 11:10:50,013 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:10:50,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2020-10-16 11:10:50,015 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2020-10-16 11:10:50,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2020-10-16 11:10:50,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 195 transitions.
[2020-10-16 11:10:50,015 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 195 transitions. Word has length 27
[2020-10-16 11:10:50,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:10:50,015 INFO  L481      AbstractCegarLoop]: Abstraction has 92 states and 195 transitions.
[2020-10-16 11:10:50,016 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:10:50,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 195 transitions.
[2020-10-16 11:10:50,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 11:10:50,016 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:10:50,016 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:10:50,017 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-16 11:10:50,017 INFO  L429      AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:10:50,017 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:10:50,017 INFO  L82        PathProgramCache]: Analyzing trace with hash 1976359869, now seen corresponding path program 3 times
[2020-10-16 11:10:50,017 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:10:50,017 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122454262]
[2020-10-16 11:10:50,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:10:50,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:10:50,074 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:10:50,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:10:50,188 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:10:50,251 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:10:50,253 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:10:50,253 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-16 11:10:50,255 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:10:50,272 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In540274733 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In540274733 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In540274733 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In540274733 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In540274733| ULTIMATE.start_assume_abort_if_not_~cond_Out540274733) (or (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out540274733 0)) (and .cse2 (= ~y$w_buff0_used~0_Out540274733 ~y$w_buff0_used~0_In540274733))) (or (and .cse3 (= ~y$w_buff1_used~0_Out540274733 ~y$w_buff1_used~0_In540274733)) (and .cse4 .cse5 (= ~y$w_buff1_used~0_Out540274733 0))) (or (and (or (and .cse3 (= ~y~0_Out540274733 ~y~0_In540274733)) (and .cse4 (= ~y~0_Out540274733 ~y$w_buff1~0_In540274733) .cse5)) .cse2) (and .cse0 .cse1 (= ~y~0_Out540274733 ~y$w_buff0~0_In540274733))) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out540274733)) (= ~y$r_buff1_thd0~0_In540274733 ~y$r_buff1_thd0~0_Out540274733) (= ~y$r_buff0_thd0~0_In540274733 ~y$r_buff0_thd0~0_Out540274733))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In540274733|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In540274733, ~y$w_buff1~0=~y$w_buff1~0_In540274733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In540274733, ~y$w_buff0~0=~y$w_buff0~0_In540274733, ~y~0=~y~0_In540274733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In540274733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540274733}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out540274733, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out540274733|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out540274733|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out540274733|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out540274733|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out540274733|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out540274733|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In540274733|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out540274733, ~y$w_buff1~0=~y$w_buff1~0_In540274733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out540274733, ~y$w_buff0~0=~y$w_buff0~0_In540274733, ~y~0=~y~0_Out540274733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out540274733, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out540274733}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:10:50,294 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:10:50,294 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,296 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:10:50,296 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,296 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:10:50,296 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,296 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:10:50,296 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,296 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:10:50,296 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,296 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:10:50,296 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,297 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:10:50,297 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,297 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:10:50,298 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,298 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:10:50,298 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,298 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:10:50,298 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,298 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:10:50,298 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,299 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:10:50,299 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,299 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:10:50,299 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,300 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:10:50,300 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,300 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:10:50,300 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,300 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:10:50,300 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,301 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:10:50,301 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,302 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:10:50,302 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,302 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:10:50,302 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,302 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:10:50,302 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,303 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:10:50,303 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,303 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:10:50,303 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,303 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:10:50,303 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,304 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:10:50,304 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,304 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:10:50,304 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,304 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:10:50,304 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,305 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:10:50,305 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,305 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:10:50,305 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:10:50,385 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:10:50 BasicIcfg
[2020-10-16 11:10:50,385 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:10:50,387 INFO  L168              Benchmark]: Toolchain (without parser) took 23258.28 ms. Allocated memory was 140.0 MB in the beginning and 533.2 MB in the end (delta: 393.2 MB). Free memory was 101.2 MB in the beginning and 410.9 MB in the end (delta: -309.8 MB). Peak memory consumption was 443.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,388 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,396 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 927.53 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 101.0 MB in the beginning and 160.4 MB in the end (delta: -59.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,397 INFO  L168              Benchmark]: Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 206.6 MB. Free memory was 160.4 MB in the beginning and 157.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,398 INFO  L168              Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 206.6 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,398 INFO  L168              Benchmark]: RCFGBuilder took 2283.75 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 154.5 MB in the beginning and 157.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,399 INFO  L168              Benchmark]: TraceAbstraction took 19924.13 ms. Allocated memory was 244.8 MB in the beginning and 533.2 MB in the end (delta: 288.4 MB). Free memory was 156.2 MB in the beginning and 410.9 MB in the end (delta: -254.7 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:10:50,407 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.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 927.53 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 101.0 MB in the beginning and 160.4 MB in the end (delta: -59.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 206.6 MB. Free memory was 160.4 MB in the beginning and 157.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 41.92 ms. Allocated memory is still 206.6 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2283.75 ms. Allocated memory was 206.6 MB in the beginning and 244.8 MB in the end (delta: 38.3 MB). Free memory was 154.5 MB in the beginning and 157.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 19924.13 ms. Allocated memory was 244.8 MB in the beginning and 533.2 MB in the end (delta: 288.4 MB). Free memory was 156.2 MB in the beginning and 410.9 MB in the end (delta: -254.7 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1773 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.7s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7948 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t781;
[L836]  FCALL, FORK  0  pthread_create(&t781, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L837]               0  pthread_t t782;
[L838]  FCALL, FORK  0  pthread_create(&t782, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L839]               0  pthread_t t783;
[L840]  FCALL, FORK  0  pthread_create(&t783, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               0  pthread_t t784;
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L784]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]  FCALL, FORK  0  pthread_create(&t784, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L787]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L804]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L807]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L810]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L814]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L815]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L816]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L816]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L817]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L817]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L742]               1  __unbuffered_p0_EAX = x
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L754]               2  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  y$flush_delayed = weak$$choice2
[L858]               0  y$mem_tmp = y
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L860]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L860]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L861]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L861]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L862]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L862]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L864]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L867]               0  y = y$flush_delayed ? y$mem_tmp : y
[L868]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 755 SDtfs, 856 SDslu, 1359 SDs, 0 SdLazy, 610 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1206 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 65710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...