/usr/bin/java -Xmx16000000000 -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/mix008_pso.oepc.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:39:39,695 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:39:39,698 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:39:39,738 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:39:39,738 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:39:39,746 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:39:39,749 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:39:39,753 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:39:39,756 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:39:39,760 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:39:39,761 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:39:39,762 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:39:39,762 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:39:39,765 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:39:39,766 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:39:39,767 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:39:39,767 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:39:39,770 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:39:39,772 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:39:39,778 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:39:39,780 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:39:39,781 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:39:39,784 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:39:39,785 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:39:39,795 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:39:39,795 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:39:39,796 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:39:39,800 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:39:39,800 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:39:39,803 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:39:39,803 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:39:39,804 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:39:39,805 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:39:39,805 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:39:39,806 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:39:39,806 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:39:39,807 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:39:39,810 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:39:39,810 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:39:39,811 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:39:39,812 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:39:39,812 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-11 14:39:39,850 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:39:39,850 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:39:39,851 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:39:39,852 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:39:39,852 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:39:39,852 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:39:39,852 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:39:39,852 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:39:39,853 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:39:39,853 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:39:39,854 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:39:39,854 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:39:39,854 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:39:39,855 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:39:39,855 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:39:39,855 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:39:39,855 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:39:39,856 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:39:39,856 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:39:39,856 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:39:39,856 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:39:39,856 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:39:39,856 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:39:39,857 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:39:39,857 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:39:39,857 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:39:39,857 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:39:39,857 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:39:39,858 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:39:39,858 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:39:40,156 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:39:40,170 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:39:40,174 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:39:40,175 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:39:40,176 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:39:40,176 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_pso.oepc.i
[2020-10-11 14:39:40,232 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c7d3dc8/15ec2b3ead7f47268b17dfdcf3697a1c/FLAG8aa3d8bf7
[2020-10-11 14:39:40,833 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:39:40,834 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_pso.oepc.i
[2020-10-11 14:39:40,857 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c7d3dc8/15ec2b3ead7f47268b17dfdcf3697a1c/FLAG8aa3d8bf7
[2020-10-11 14:39:41,050 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c7d3dc8/15ec2b3ead7f47268b17dfdcf3697a1c
[2020-10-11 14:39:41,059 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:39:41,060 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:39:41,061 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:39:41,062 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:39:41,065 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:39:41,066 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,069 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c253b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41, skipping insertion in model container
[2020-10-11 14:39:41,070 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,078 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:39:41,146 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:39:41,656 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:39:41,669 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:39:41,775 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:39:41,855 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:39:41,856 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41 WrapperNode
[2020-10-11 14:39:41,856 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:39:41,857 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:39:41,857 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:39:41,857 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:39:41,866 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,888 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,926 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:39:41,927 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:39:41,927 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:39:41,927 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:39:41,935 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,935 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,940 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,941 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,953 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,958 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,962 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
[2020-10-11 14:39:41,968 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:39:41,968 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:39:41,968 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:39:41,969 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:39:41,969 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:39:42,033 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:39:42,033 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:39:42,033 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:39:42,034 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:39:42,034 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:39:42,034 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:39:42,034 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:39:42,034 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:39:42,035 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:39:42,035 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:39:42,035 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 14:39:42,035 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 14:39:42,035 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:39:42,035 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:39:42,036 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:39:42,038 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 14:39:44,295 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:39:44,296 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:39:44,299 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:44 BoogieIcfgContainer
[2020-10-11 14:39:44,299 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:39:44,301 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:39:44,301 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:39:44,305 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:39:44,305 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:41" (1/3) ...
[2020-10-11 14:39:44,306 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c61a8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:44, skipping insertion in model container
[2020-10-11 14:39:44,306 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:41" (2/3) ...
[2020-10-11 14:39:44,307 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c61a8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:44, skipping insertion in model container
[2020-10-11 14:39:44,307 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:44" (3/3) ...
[2020-10-11 14:39:44,309 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix008_pso.oepc.i
[2020-10-11 14:39:44,362 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:39:44,363 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:39:44,373 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:39:44,374 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:39:44,410 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,411 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,411 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,411 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,412 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,414 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,414 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,419 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,419 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,419 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,420 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,420 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,422 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,423 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,424 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,430 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,430 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,430 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,431 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,434 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,435 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,435 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,435 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,435 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,435 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,438 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,439 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,439 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,442 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,442 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,442 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,443 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,443 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,443 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,443 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,443 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,444 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,444 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,444 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,444 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,444 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,445 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,445 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,445 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,445 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,445 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,446 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,446 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,446 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,446 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,446 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,447 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,447 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,447 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,447 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,447 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,448 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,448 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,448 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,448 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,448 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,452 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,452 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,453 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:39:44,469 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 14:39:44,491 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:39:44,491 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:39:44,491 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:39:44,491 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:39:44,492 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:39:44,492 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:39:44,492 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:39:44,492 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:39:44,508 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:39:44,511 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 248 flow
[2020-10-11 14:39:44,514 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 248 flow
[2020-10-11 14:39:44,517 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow
[2020-10-11 14:39:44,587 INFO  L129       PetriNetUnfolder]: 2/110 cut-off events.
[2020-10-11 14:39:44,588 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:39:44,595 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. 
[2020-10-11 14:39:44,602 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2824
[2020-10-11 14:39:44,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,696 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,700 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,708 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,709 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,716 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,717 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,754 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,755 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,756 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,761 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,924 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,925 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,925 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,929 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,932 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:44,959 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:44,959 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,962 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:44,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:44,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,000 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,003 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,003 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,025 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,025 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,032 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,033 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,129 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,130 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,134 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,156 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,157 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,162 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,452 WARN  L193               SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-11 14:39:45,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,623 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:45,639 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,639 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:45,641 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,641 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:45,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:45,644 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:45,646 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:45,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,648 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:45,718 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,718 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:39:45,720 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:45,720 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:45,755 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,756 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,759 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,762 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,763 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,780 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,876 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,880 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,882 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,898 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,898 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,899 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,899 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:45,901 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:45,902 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,903 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,904 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:45,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:45,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:39:45,973 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:45,973 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:45,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:45,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:46,009 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:46,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:46,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:46,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:46,012 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:46,014 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:46,014 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:46,016 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:46,016 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:46,017 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:46,018 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:46,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,082 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,085 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,087 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,101 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,102 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,102 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,103 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,104 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,391 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,395 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,412 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,694 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,698 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,699 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,703 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:46,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,705 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:46,718 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,718 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,719 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,720 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:46,722 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:46,722 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,724 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:46,724 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:46,958 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:39:46,958 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,230 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,231 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,233 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,233 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,235 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,235 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,256 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,257 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,257 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,258 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,260 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-11 14:39:47,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:47,322 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,353 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,353 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,355 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,356 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,356 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,357 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,358 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,358 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,360 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:47,360 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,363 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,396 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,412 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,437 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,438 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,442 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,442 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,455 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,457 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,459 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,480 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,482 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,484 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,502 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,528 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,528 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,529 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,533 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,547 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,548 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,585 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,585 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,590 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,604 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,608 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,609 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,680 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,681 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,682 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:39:47,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:47,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,685 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,685 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,686 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,686 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,714 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:39:47,715 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-11 14:39:47,717 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-11 14:39:47,717 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,739 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,741 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,742 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,743 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,744 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,744 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,756 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,756 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,758 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,759 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,761 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,852 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,854 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,854 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:39:47,865 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,865 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:39:47,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:39:47,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:47,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:39:47,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:39:48,692 WARN  L193               SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-11 14:39:48,829 WARN  L193               SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-11 14:39:48,841 INFO  L132        LiptonReduction]: Checked pairs total: 9356
[2020-10-11 14:39:48,841 INFO  L134        LiptonReduction]: Total number of compositions: 89
[2020-10-11 14:39:48,848 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow
[2020-10-11 14:39:49,371 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6914 states.
[2020-10-11 14:39:49,374 INFO  L276                IsEmpty]: Start isEmpty. Operand 6914 states.
[2020-10-11 14:39:49,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-11 14:39:49,381 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:49,382 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-11 14:39:49,382 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:49,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:49,389 INFO  L82        PathProgramCache]: Analyzing trace with hash 1199713, now seen corresponding path program 1 times
[2020-10-11 14:39:49,399 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:49,400 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569794946]
[2020-10-11 14:39:49,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:49,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:49,623 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-11 14:39:49,623 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569794946]
[2020-10-11 14:39:49,624 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:49,625 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:39:49,625 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287496147]
[2020-10-11 14:39:49,630 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:39:49,631 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:49,646 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:39:49,647 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:39:49,649 INFO  L87              Difference]: Start difference. First operand 6914 states. Second operand 3 states.
[2020-10-11 14:39:49,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:49,841 INFO  L93              Difference]: Finished difference Result 5762 states and 23320 transitions.
[2020-10-11 14:39:49,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:39:49,843 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-11 14:39:49,844 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:49,917 INFO  L225             Difference]: With dead ends: 5762
[2020-10-11 14:39:49,918 INFO  L226             Difference]: Without dead ends: 4862
[2020-10-11 14:39:49,919 INFO  L673         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-11 14:39:50,058 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4862 states.
[2020-10-11 14:39:50,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862.
[2020-10-11 14:39:50,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4862 states.
[2020-10-11 14:39:50,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions.
[2020-10-11 14:39:50,312 INFO  L78                 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3
[2020-10-11 14:39:50,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:50,313 INFO  L481      AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions.
[2020-10-11 14:39:50,313 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:39:50,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions.
[2020-10-11 14:39:50,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:39:50,318 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:50,318 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:50,318 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:39:50,318 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:50,319 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:50,319 INFO  L82        PathProgramCache]: Analyzing trace with hash 529556427, now seen corresponding path program 1 times
[2020-10-11 14:39:50,319 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:50,319 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18753213]
[2020-10-11 14:39:50,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:50,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:50,467 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-11 14:39:50,467 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18753213]
[2020-10-11 14:39:50,468 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:50,468 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:39:50,468 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045971865]
[2020-10-11 14:39:50,470 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:39:50,470 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:50,470 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:39:50,471 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:39:50,471 INFO  L87              Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 4 states.
[2020-10-11 14:39:50,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:50,555 INFO  L93              Difference]: Finished difference Result 5162 states and 20060 transitions.
[2020-10-11 14:39:50,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:50,555 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-11 14:39:50,556 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:50,594 INFO  L225             Difference]: With dead ends: 5162
[2020-10-11 14:39:50,594 INFO  L226             Difference]: Without dead ends: 4262
[2020-10-11 14:39:50,595 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:39:50,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4262 states.
[2020-10-11 14:39:50,772 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262.
[2020-10-11 14:39:50,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4262 states.
[2020-10-11 14:39:50,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions.
[2020-10-11 14:39:50,802 INFO  L78                 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12
[2020-10-11 14:39:50,803 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:50,803 INFO  L481      AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions.
[2020-10-11 14:39:50,803 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:39:50,804 INFO  L276                IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions.
[2020-10-11 14:39:50,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 14:39:50,808 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:50,808 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:50,809 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:39:50,809 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:50,809 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:50,809 INFO  L82        PathProgramCache]: Analyzing trace with hash 2047532413, now seen corresponding path program 1 times
[2020-10-11 14:39:50,809 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:50,810 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217053227]
[2020-10-11 14:39:50,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:50,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:50,925 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-11 14:39:50,925 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217053227]
[2020-10-11 14:39:50,925 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:50,926 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:39:50,926 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537474724]
[2020-10-11 14:39:50,927 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:39:50,927 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:50,927 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:39:50,927 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:39:50,927 INFO  L87              Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand 4 states.
[2020-10-11 14:39:50,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:50,994 INFO  L93              Difference]: Finished difference Result 4766 states and 18338 transitions.
[2020-10-11 14:39:50,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:50,994 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-11 14:39:50,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:51,031 INFO  L225             Difference]: With dead ends: 4766
[2020-10-11 14:39:51,031 INFO  L226             Difference]: Without dead ends: 4166
[2020-10-11 14:39:51,032 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:39:51,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4166 states.
[2020-10-11 14:39:51,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4166.
[2020-10-11 14:39:51,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4166 states.
[2020-10-11 14:39:51,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16380 transitions.
[2020-10-11 14:39:51,193 INFO  L78                 Accepts]: Start accepts. Automaton has 4166 states and 16380 transitions. Word has length 14
[2020-10-11 14:39:51,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:51,194 INFO  L481      AbstractCegarLoop]: Abstraction has 4166 states and 16380 transitions.
[2020-10-11 14:39:51,194 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:39:51,194 INFO  L276                IsEmpty]: Start isEmpty. Operand 4166 states and 16380 transitions.
[2020-10-11 14:39:51,198 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:39:51,198 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:51,198 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:51,199 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:39:51,199 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:51,199 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:51,199 INFO  L82        PathProgramCache]: Analyzing trace with hash -1777619556, now seen corresponding path program 1 times
[2020-10-11 14:39:51,200 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:51,200 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144125290]
[2020-10-11 14:39:51,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:51,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:51,313 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-11 14:39:51,313 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144125290]
[2020-10-11 14:39:51,313 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:51,313 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:39:51,314 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590789785]
[2020-10-11 14:39:51,316 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:39:51,316 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:51,317 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:39:51,317 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:39:51,317 INFO  L87              Difference]: Start difference. First operand 4166 states and 16380 transitions. Second operand 4 states.
[2020-10-11 14:39:51,365 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:51,365 INFO  L93              Difference]: Finished difference Result 4350 states and 16714 transitions.
[2020-10-11 14:39:51,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:51,366 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-11 14:39:51,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:51,383 INFO  L225             Difference]: With dead ends: 4350
[2020-10-11 14:39:51,383 INFO  L226             Difference]: Without dead ends: 3798
[2020-10-11 14:39:51,383 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:39:51,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3798 states.
[2020-10-11 14:39:51,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3798.
[2020-10-11 14:39:51,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3798 states.
[2020-10-11 14:39:51,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 14792 transitions.
[2020-10-11 14:39:51,602 INFO  L78                 Accepts]: Start accepts. Automaton has 3798 states and 14792 transitions. Word has length 15
[2020-10-11 14:39:51,602 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:51,602 INFO  L481      AbstractCegarLoop]: Abstraction has 3798 states and 14792 transitions.
[2020-10-11 14:39:51,602 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:39:51,602 INFO  L276                IsEmpty]: Start isEmpty. Operand 3798 states and 14792 transitions.
[2020-10-11 14:39:51,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:39:51,608 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:51,608 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:51,608 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:39:51,608 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:51,609 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:51,609 INFO  L82        PathProgramCache]: Analyzing trace with hash -1616746342, now seen corresponding path program 1 times
[2020-10-11 14:39:51,609 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:51,609 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075408163]
[2020-10-11 14:39:51,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:51,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:51,676 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-11 14:39:51,677 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075408163]
[2020-10-11 14:39:51,677 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:51,678 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:39:51,678 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133570714]
[2020-10-11 14:39:51,678 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:39:51,679 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:51,679 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:39:51,680 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:39:51,680 INFO  L87              Difference]: Start difference. First operand 3798 states and 14792 transitions. Second operand 4 states.
[2020-10-11 14:39:51,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:51,745 INFO  L93              Difference]: Finished difference Result 3646 states and 12872 transitions.
[2020-10-11 14:39:51,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:51,746 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-11 14:39:51,746 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:51,757 INFO  L225             Difference]: With dead ends: 3646
[2020-10-11 14:39:51,758 INFO  L226             Difference]: Without dead ends: 2746
[2020-10-11 14:39:51,758 INFO  L673         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-11 14:39:51,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2746 states.
[2020-10-11 14:39:51,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2746.
[2020-10-11 14:39:51,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2746 states.
[2020-10-11 14:39:51,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 9532 transitions.
[2020-10-11 14:39:51,840 INFO  L78                 Accepts]: Start accepts. Automaton has 2746 states and 9532 transitions. Word has length 17
[2020-10-11 14:39:51,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:51,840 INFO  L481      AbstractCegarLoop]: Abstraction has 2746 states and 9532 transitions.
[2020-10-11 14:39:51,841 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:39:51,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 2746 states and 9532 transitions.
[2020-10-11 14:39:51,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-11 14:39:51,847 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:51,847 INFO  L421         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-11 14:39:51,847 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:39:51,847 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:51,847 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:51,847 INFO  L82        PathProgramCache]: Analyzing trace with hash -950788854, now seen corresponding path program 1 times
[2020-10-11 14:39:51,848 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:51,848 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333623871]
[2020-10-11 14:39:51,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:51,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:51,907 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-11 14:39:51,907 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333623871]
[2020-10-11 14:39:51,908 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:51,908 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:39:51,908 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813418938]
[2020-10-11 14:39:51,908 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:39:51,908 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:51,909 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:39:51,909 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:39:51,909 INFO  L87              Difference]: Start difference. First operand 2746 states and 9532 transitions. Second operand 4 states.
[2020-10-11 14:39:51,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:51,960 INFO  L93              Difference]: Finished difference Result 4360 states and 14717 transitions.
[2020-10-11 14:39:51,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:51,961 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2020-10-11 14:39:51,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:51,973 INFO  L225             Difference]: With dead ends: 4360
[2020-10-11 14:39:51,973 INFO  L226             Difference]: Without dead ends: 2908
[2020-10-11 14:39:51,974 INFO  L673         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-11 14:39:51,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2908 states.
[2020-10-11 14:39:52,043 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2686.
[2020-10-11 14:39:52,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2686 states.
[2020-10-11 14:39:52,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 8974 transitions.
[2020-10-11 14:39:52,054 INFO  L78                 Accepts]: Start accepts. Automaton has 2686 states and 8974 transitions. Word has length 20
[2020-10-11 14:39:52,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:52,054 INFO  L481      AbstractCegarLoop]: Abstraction has 2686 states and 8974 transitions.
[2020-10-11 14:39:52,054 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:39:52,054 INFO  L276                IsEmpty]: Start isEmpty. Operand 2686 states and 8974 transitions.
[2020-10-11 14:39:52,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-11 14:39:52,060 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:52,060 INFO  L421         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-11 14:39:52,060 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:39:52,061 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:52,061 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:52,061 INFO  L82        PathProgramCache]: Analyzing trace with hash 232260611, now seen corresponding path program 1 times
[2020-10-11 14:39:52,061 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:52,061 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991009322]
[2020-10-11 14:39:52,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:52,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:52,129 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-11 14:39:52,129 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991009322]
[2020-10-11 14:39:52,129 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:52,130 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:39:52,130 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041594343]
[2020-10-11 14:39:52,130 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:39:52,130 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:52,131 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:39:52,131 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:39:52,131 INFO  L87              Difference]: Start difference. First operand 2686 states and 8974 transitions. Second operand 5 states.
[2020-10-11 14:39:52,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:52,196 INFO  L93              Difference]: Finished difference Result 2196 states and 6755 transitions.
[2020-10-11 14:39:52,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:39:52,197 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2020-10-11 14:39:52,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:52,203 INFO  L225             Difference]: With dead ends: 2196
[2020-10-11 14:39:52,203 INFO  L226             Difference]: Without dead ends: 1696
[2020-10-11 14:39:52,203 INFO  L673         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-11 14:39:52,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1696 states.
[2020-10-11 14:39:52,241 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1696.
[2020-10-11 14:39:52,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1696 states.
[2020-10-11 14:39:52,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 5124 transitions.
[2020-10-11 14:39:52,247 INFO  L78                 Accepts]: Start accepts. Automaton has 1696 states and 5124 transitions. Word has length 20
[2020-10-11 14:39:52,247 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:52,248 INFO  L481      AbstractCegarLoop]: Abstraction has 1696 states and 5124 transitions.
[2020-10-11 14:39:52,248 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:39:52,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 1696 states and 5124 transitions.
[2020-10-11 14:39:52,252 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-11 14:39:52,252 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:52,252 INFO  L421         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-11 14:39:52,253 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:39:52,253 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:52,253 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:52,253 INFO  L82        PathProgramCache]: Analyzing trace with hash 105553197, now seen corresponding path program 1 times
[2020-10-11 14:39:52,253 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:52,254 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065296077]
[2020-10-11 14:39:52,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:52,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:52,372 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-11 14:39:52,373 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065296077]
[2020-10-11 14:39:52,373 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:52,373 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:39:52,373 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393593431]
[2020-10-11 14:39:52,374 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:39:52,374 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:52,374 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:39:52,374 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:39:52,374 INFO  L87              Difference]: Start difference. First operand 1696 states and 5124 transitions. Second operand 6 states.
[2020-10-11 14:39:52,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:52,437 INFO  L93              Difference]: Finished difference Result 1468 states and 4413 transitions.
[2020-10-11 14:39:52,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:39:52,438 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2020-10-11 14:39:52,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:52,443 INFO  L225             Difference]: With dead ends: 1468
[2020-10-11 14:39:52,443 INFO  L226             Difference]: Without dead ends: 1328
[2020-10-11 14:39:52,444 INFO  L673         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-11 14:39:52,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1328 states.
[2020-10-11 14:39:52,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328.
[2020-10-11 14:39:52,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1328 states.
[2020-10-11 14:39:52,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4046 transitions.
[2020-10-11 14:39:52,477 INFO  L78                 Accepts]: Start accepts. Automaton has 1328 states and 4046 transitions. Word has length 23
[2020-10-11 14:39:52,477 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:52,477 INFO  L481      AbstractCegarLoop]: Abstraction has 1328 states and 4046 transitions.
[2020-10-11 14:39:52,477 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:39:52,477 INFO  L276                IsEmpty]: Start isEmpty. Operand 1328 states and 4046 transitions.
[2020-10-11 14:39:52,481 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:39:52,481 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:52,482 INFO  L421         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]
[2020-10-11 14:39:52,482 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:39:52,482 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:52,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:52,482 INFO  L82        PathProgramCache]: Analyzing trace with hash -747580507, now seen corresponding path program 1 times
[2020-10-11 14:39:52,483 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:52,483 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904888068]
[2020-10-11 14:39:52,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:52,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:52,561 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-11 14:39:52,562 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904888068]
[2020-10-11 14:39:52,562 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:52,562 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:39:52,562 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696166170]
[2020-10-11 14:39:52,563 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:39:52,563 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:52,563 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:39:52,563 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:39:52,563 INFO  L87              Difference]: Start difference. First operand 1328 states and 4046 transitions. Second operand 5 states.
[2020-10-11 14:39:52,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:52,604 INFO  L93              Difference]: Finished difference Result 1752 states and 5224 transitions.
[2020-10-11 14:39:52,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:39:52,604 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2020-10-11 14:39:52,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:52,608 INFO  L225             Difference]: With dead ends: 1752
[2020-10-11 14:39:52,609 INFO  L226             Difference]: Without dead ends: 1214
[2020-10-11 14:39:52,609 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:39:52,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1214 states.
[2020-10-11 14:39:52,636 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1208.
[2020-10-11 14:39:52,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1208 states.
[2020-10-11 14:39:52,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 3539 transitions.
[2020-10-11 14:39:52,640 INFO  L78                 Accepts]: Start accepts. Automaton has 1208 states and 3539 transitions. Word has length 26
[2020-10-11 14:39:52,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:52,641 INFO  L481      AbstractCegarLoop]: Abstraction has 1208 states and 3539 transitions.
[2020-10-11 14:39:52,641 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:39:52,641 INFO  L276                IsEmpty]: Start isEmpty. Operand 1208 states and 3539 transitions.
[2020-10-11 14:39:52,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:39:52,644 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:52,645 INFO  L421         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]
[2020-10-11 14:39:52,645 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:39:52,645 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:52,645 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:52,645 INFO  L82        PathProgramCache]: Analyzing trace with hash -280723253, now seen corresponding path program 2 times
[2020-10-11 14:39:52,646 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:52,646 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477062272]
[2020-10-11 14:39:52,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:52,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:52,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:39:52,801 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477062272]
[2020-10-11 14:39:52,801 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:52,801 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:39:52,802 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716282025]
[2020-10-11 14:39:52,802 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:39:52,802 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:52,803 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:39:52,803 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:39:52,803 INFO  L87              Difference]: Start difference. First operand 1208 states and 3539 transitions. Second operand 7 states.
[2020-10-11 14:39:52,884 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:52,884 INFO  L93              Difference]: Finished difference Result 1165 states and 3453 transitions.
[2020-10-11 14:39:52,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-11 14:39:52,885 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 26
[2020-10-11 14:39:52,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:52,887 INFO  L225             Difference]: With dead ends: 1165
[2020-10-11 14:39:52,888 INFO  L226             Difference]: Without dead ends: 611
[2020-10-11 14:39:52,888 INFO  L673         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-11 14:39:52,890 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 611 states.
[2020-10-11 14:39:52,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611.
[2020-10-11 14:39:52,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 611 states.
[2020-10-11 14:39:52,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1782 transitions.
[2020-10-11 14:39:52,907 INFO  L78                 Accepts]: Start accepts. Automaton has 611 states and 1782 transitions. Word has length 26
[2020-10-11 14:39:52,907 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:52,907 INFO  L481      AbstractCegarLoop]: Abstraction has 611 states and 1782 transitions.
[2020-10-11 14:39:52,907 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:39:52,907 INFO  L276                IsEmpty]: Start isEmpty. Operand 611 states and 1782 transitions.
[2020-10-11 14:39:52,912 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2020-10-11 14:39:52,912 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:52,912 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:52,912 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:39:52,913 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:52,913 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:52,913 INFO  L82        PathProgramCache]: Analyzing trace with hash 1385824986, now seen corresponding path program 1 times
[2020-10-11 14:39:52,913 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:52,914 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254304503]
[2020-10-11 14:39:52,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:53,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:39:53,266 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-11 14:39:53,266 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254304503]
[2020-10-11 14:39:53,266 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:39:53,266 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:39:53,267 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028776995]
[2020-10-11 14:39:53,267 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:39:53,267 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:39:53,268 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:39:53,268 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:39:53,268 INFO  L87              Difference]: Start difference. First operand 611 states and 1782 transitions. Second operand 9 states.
[2020-10-11 14:39:53,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:39:53,606 INFO  L93              Difference]: Finished difference Result 704 states and 2022 transitions.
[2020-10-11 14:39:53,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:39:53,607 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 30
[2020-10-11 14:39:53,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:39:53,609 INFO  L225             Difference]: With dead ends: 704
[2020-10-11 14:39:53,609 INFO  L226             Difference]: Without dead ends: 347
[2020-10-11 14:39:53,610 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2020-10-11 14:39:53,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 347 states.
[2020-10-11 14:39:53,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347.
[2020-10-11 14:39:53,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 347 states.
[2020-10-11 14:39:53,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 886 transitions.
[2020-10-11 14:39:53,618 INFO  L78                 Accepts]: Start accepts. Automaton has 347 states and 886 transitions. Word has length 30
[2020-10-11 14:39:53,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:39:53,618 INFO  L481      AbstractCegarLoop]: Abstraction has 347 states and 886 transitions.
[2020-10-11 14:39:53,618 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:39:53,618 INFO  L276                IsEmpty]: Start isEmpty. Operand 347 states and 886 transitions.
[2020-10-11 14:39:53,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2020-10-11 14:39:53,619 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:39:53,620 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:39:53,620 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:39:53,620 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:39:53,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:39:53,620 INFO  L82        PathProgramCache]: Analyzing trace with hash -681194348, now seen corresponding path program 2 times
[2020-10-11 14:39:53,620 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:39:53,621 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323338405]
[2020-10-11 14:39:53,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:39:53,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:39:53,681 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:39:53,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:39:53,736 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:39:53,775 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:39:53,775 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:39:53,775 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:39:53,804 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-11 14:39:53,804 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,812 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-11 14:39:53,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,813 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-11 14:39:53,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,813 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-11 14:39:53,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,813 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-11 14:39:53,814 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,814 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-11 14:39:53,814 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,814 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-11 14:39:53,814 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,819 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-11 14:39:53,819 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,819 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-11 14:39:53,819 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,819 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-11 14:39:53,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,820 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-11 14:39:53,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,820 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-11 14:39:53,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,821 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-11 14:39:53,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,821 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-11 14:39:53,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,821 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-11 14:39:53,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,821 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-11 14:39:53,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,822 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-11 14:39:53,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,822 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-11 14:39:53,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,822 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-11 14:39:53,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,822 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-11 14:39:53,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,823 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-11 14:39:53,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,823 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-11 14:39:53,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,823 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-11 14:39:53,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,824 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-11 14:39:53,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,824 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-11 14:39:53,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,824 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-11 14:39:53,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,825 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-11 14:39:53,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,825 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-11 14:39:53,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,825 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-11 14:39:53,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,826 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-11 14:39:53,826 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,826 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-11 14:39:53,826 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,826 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-11 14:39:53,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,827 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-11 14:39:53,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,827 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-11 14:39:53,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,827 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-11 14:39:53,828 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,828 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-11 14:39:53,828 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,828 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-11 14:39:53,828 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,829 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-11 14:39:53,829 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,829 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-11 14:39:53,830 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,830 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-11 14:39:53,830 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,830 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-11 14:39:53,830 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,830 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-11 14:39:53,831 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:39:53,910 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:39:53 BasicIcfg
[2020-10-11 14:39:53,910 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:39:53,912 INFO  L168              Benchmark]: Toolchain (without parser) took 12851.85 ms. Allocated memory was 251.7 MB in the beginning and 615.0 MB in the end (delta: 363.3 MB). Free memory was 206.8 MB in the beginning and 442.1 MB in the end (delta: -235.3 MB). Peak memory consumption was 128.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,913 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,914 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 795.08 ms. Allocated memory was 251.7 MB in the beginning and 316.1 MB in the end (delta: 64.5 MB). Free memory was 206.8 MB in the beginning and 262.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,914 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.47 ms. Allocated memory is still 316.1 MB. Free memory was 262.6 MB in the beginning and 260.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,915 INFO  L168              Benchmark]: Boogie Preprocessor took 41.35 ms. Allocated memory is still 316.1 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,916 INFO  L168              Benchmark]: RCFGBuilder took 2331.42 ms. Allocated memory was 316.1 MB in the beginning and 359.1 MB in the end (delta: 43.0 MB). Free memory was 257.6 MB in the beginning and 160.5 MB in the end (delta: 97.2 MB). Peak memory consumption was 140.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,916 INFO  L168              Benchmark]: TraceAbstraction took 9609.09 ms. Allocated memory was 359.1 MB in the beginning and 615.0 MB in the end (delta: 255.9 MB). Free memory was 160.5 MB in the beginning and 442.1 MB in the end (delta: -281.6 MB). There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:39:53,921 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 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 795.08 ms. Allocated memory was 251.7 MB in the beginning and 316.1 MB in the end (delta: 64.5 MB). Free memory was 206.8 MB in the beginning and 262.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 69.47 ms. Allocated memory is still 316.1 MB. Free memory was 262.6 MB in the beginning and 260.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 41.35 ms. Allocated memory is still 316.1 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2331.42 ms. Allocated memory was 316.1 MB in the beginning and 359.1 MB in the end (delta: 43.0 MB). Free memory was 257.6 MB in the beginning and 160.5 MB in the end (delta: 97.2 MB). Peak memory consumption was 140.1 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 9609.09 ms. Allocated memory was 359.1 MB in the beginning and 615.0 MB in the end (delta: 255.9 MB). Free memory was 160.5 MB in the beginning and 442.1 MB in the end (delta: -281.6 MB). There was no memory consumed. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1877 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 312 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 125 PlacesBefore, 49 PlacesAfterwards, 114 TransitionsBefore, 37 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 9356 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p2_EAX = 0;
[L703]               0  int __unbuffered_p2_EBX = 0;
[L705]               0  int __unbuffered_p3_EAX = 0;
[L707]               0  int __unbuffered_p3_EBX = 0;
[L709]               0  int a = 0;
[L710]               0  _Bool a$flush_delayed;
[L711]               0  int a$mem_tmp;
[L712]               0  _Bool a$r_buff0_thd0;
[L713]               0  _Bool a$r_buff0_thd1;
[L714]               0  _Bool a$r_buff0_thd2;
[L715]               0  _Bool a$r_buff0_thd3;
[L716]               0  _Bool a$r_buff0_thd4;
[L717]               0  _Bool a$r_buff1_thd0;
[L718]               0  _Bool a$r_buff1_thd1;
[L719]               0  _Bool a$r_buff1_thd2;
[L720]               0  _Bool a$r_buff1_thd3;
[L721]               0  _Bool a$r_buff1_thd4;
[L722]               0  _Bool a$read_delayed;
[L723]               0  int *a$read_delayed_var;
[L724]               0  int a$w_buff0;
[L725]               0  _Bool a$w_buff0_used;
[L726]               0  int a$w_buff1;
[L727]               0  _Bool a$w_buff1_used;
[L728]               0  _Bool main$tmp_guard0;
[L729]               0  _Bool main$tmp_guard1;
[L731]               0  int x = 0;
[L733]               0  int y = 0;
[L735]               0  int z = 0;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L858]               0  pthread_t t217;
[L859]  FCALL, FORK  0  pthread_create(&t217, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L860]               0  pthread_t t218;
[L741]               1  a$w_buff1 = a$w_buff0
[L742]               1  a$w_buff0 = 1
[L743]               1  a$w_buff1_used = a$w_buff0_used
[L744]               1  a$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L746]               1  a$r_buff1_thd0 = a$r_buff0_thd0
[L747]               1  a$r_buff1_thd1 = a$r_buff0_thd1
[L748]               1  a$r_buff1_thd2 = a$r_buff0_thd2
[L749]               1  a$r_buff1_thd3 = a$r_buff0_thd3
[L750]               1  a$r_buff1_thd4 = a$r_buff0_thd4
[L751]               1  a$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L754]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L861]  FCALL, FORK  0  pthread_create(&t218, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L771]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L774]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L777]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L777]  EXPR         2  a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a
[L777]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L777]               2  a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L778]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L778]               2  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L779]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L779]               2  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L780]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L780]               2  a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L781]  EXPR         2  a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L781]               2  a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L784]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L786]               2  return 0;
[L862]               0  pthread_t t219;
[L863]  FCALL, FORK  0  pthread_create(&t219, ((void *)0), P2, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L864]               0  pthread_t t220;
[L865]  FCALL, FORK  0  pthread_create(&t220, ((void *)0), P3, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L791]               3  y = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0]
[L794]               3  __unbuffered_p2_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0]
[L797]               3  __unbuffered_p2_EBX = z
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0]
[L800]  EXPR         3  a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L800]               3  a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L801]  EXPR         3  a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L801]               3  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L802]  EXPR         3  a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L802]               3  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L803]  EXPR         3  a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L803]               3  a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L804]  EXPR         3  a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L804]               3  a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L814]               4  z = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1]
[L817]               4  __unbuffered_p3_EAX = z
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1]
[L820]               4  weak$$choice0 = __VERIFIER_nondet_bool()
[L821]               4  weak$$choice2 = __VERIFIER_nondet_bool()
[L822]               4  a$flush_delayed = weak$$choice2
[L823]               4  a$mem_tmp = a
[L824]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L824]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1
[L824]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L824]               4  a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L825]  EXPR         4  weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L825]               4  a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L826]  EXPR         4  weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L826]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)
[L826]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1
[L826]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)
[L826]  EXPR         4  weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L826]               4  a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L827]  EXPR         4  weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L827]               4  a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L828]  EXPR         4  weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L828]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L828]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0
[L828]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L828]  EXPR         4  weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L828]               4  a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L829]  EXPR         4  weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L829]               4  a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L830]  EXPR         4  weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L830]  EXPR         4  !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L830]  EXPR         4  weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L830]               4  a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L831]               4  __unbuffered_p3_EBX = a
[L832]  EXPR         4  a$flush_delayed ? a$mem_tmp : a
[L832]               4  a = a$flush_delayed ? a$mem_tmp : a
[L833]               4  a$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=10, weak$$choice2=0, x=2, y=2, z=1]
[L757]  EXPR         1  a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L757]               1  a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L758]  EXPR         1  a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L758]               1  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L759]  EXPR         1  a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L759]               1  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L760]  EXPR         1  a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L760]               1  a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L761]  EXPR         1  a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L761]               1  a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L836]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L836]  EXPR         4  a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a
[L836]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L836]               4  a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L837]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L837]               4  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L838]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L838]               4  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L839]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L839]               4  a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L840]  EXPR         4  a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L840]               4  a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L843]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L845]               4  return 0;
[L807]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L809]               3  return 0;
[L764]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L766]               1  return 0;
[L867]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L3]    COND FALSE   0  !(!cond)
[L871]  EXPR         0  a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L871]               0  a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L872]  EXPR         0  a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L872]               0  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L873]  EXPR         0  a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L873]               0  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L874]  EXPR         0  a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L874]               0  a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L875]  EXPR         0  a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L875]               0  a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L878]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=10, weak$$choice2=0, x=2, y=2, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 503 SDtfs, 594 SDslu, 1010 SDs, 0 SdLazy, 284 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6914occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 228 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 20451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...