/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:34:52,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:34:52,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:34:52,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:34:52,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:34:52,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:34:52,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:34:52,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:34:52,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:34:52,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:34:52,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:34:52,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:34:52,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:34:52,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:34:52,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:34:52,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:34:52,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:34:52,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:34:52,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:34:52,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:34:52,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:34:52,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:34:52,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:34:52,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:34:52,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:34:52,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:34:52,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:34:52,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:34:52,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:34:52,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:34:52,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:34:52,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:34:52,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:34:52,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:34:52,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:34:52,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:34:52,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:34:52,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:34:52,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:34:52,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:34:52,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:34:52,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:34:52,815 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:34:52,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:34:52,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:34:52,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:34:52,818 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:34:52,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:34:52,819 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:34:52,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:34:52,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:34:52,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:34:52,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:34:52,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:34:52,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:34:52,821 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:34:52,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:34:52,822 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:34:52,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:34:52,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:34:52,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:34:52,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:34:52,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:34:52,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:34:52,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:34:52,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:34:52,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:34:52,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:34:52,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:34:52,824 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:34:52,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:34:53,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:34:53,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:34:53,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:34:53,181 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:34:53,182 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:34:53,182 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2020-10-16 01:34:53,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e471d48/25f2255c4eb34871b9db6a512f545ace/FLAG4b8196485 [2020-10-16 01:34:53,814 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:34:53,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2020-10-16 01:34:53,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e471d48/25f2255c4eb34871b9db6a512f545ace/FLAG4b8196485 [2020-10-16 01:34:54,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e471d48/25f2255c4eb34871b9db6a512f545ace [2020-10-16 01:34:54,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:34:54,105 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:34:54,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:34:54,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:34:54,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:34:54,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:54,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4379be6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54, skipping insertion in model container [2020-10-16 01:34:54,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:54,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:34:54,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:34:54,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:34:54,795 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:34:54,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:34:54,973 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:34:54,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54 WrapperNode [2020-10-16 01:34:54,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:34:54,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:34:54,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:34:54,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:34:54,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:34:55,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:34:55,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:34:55,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:34:55,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (1/1) ... [2020-10-16 01:34:55,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:34:55,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:34:55,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:34:55,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:34:55,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (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-16 01:34:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 01:34:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:34:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:34:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:34:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:34:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:34:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:34:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:34:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:34:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:34:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:34:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 01:34:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:34:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:34:55,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:34:55,166 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:34:58,614 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:34:58,614 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 01:34:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:34:58 BoogieIcfgContainer [2020-10-16 01:34:58,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:34:58,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:34:58,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:34:58,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:34:58,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:34:54" (1/3) ... [2020-10-16 01:34:58,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207e0fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:34:58, skipping insertion in model container [2020-10-16 01:34:58,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:54" (2/3) ... [2020-10-16 01:34:58,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207e0fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:34:58, skipping insertion in model container [2020-10-16 01:34:58,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:34:58" (3/3) ... [2020-10-16 01:34:58,633 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2020-10-16 01:34:58,645 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:34:58,654 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 01:34:58,655 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:34:58,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,737 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:34:58,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-16 01:34:58,798 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:34:58,799 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:34:58,799 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:34:58,799 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:34:58,799 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:34:58,799 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:34:58,799 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:34:58,799 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:34:58,815 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2020-10-16 01:34:58,871 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 01:34:58,871 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:34:58,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2020-10-16 01:34:58,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2020-10-16 01:34:58,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 95 transitions, 199 flow [2020-10-16 01:34:58,889 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:34:58,892 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 95 transitions, 199 flow [2020-10-16 01:34:58,895 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 95 transitions, 199 flow [2020-10-16 01:34:58,895 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 95 transitions, 199 flow [2020-10-16 01:34:58,920 INFO L129 PetriNetUnfolder]: 1/95 cut-off events. [2020-10-16 01:34:58,920 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:34:58,921 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 1/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 01:34:58,924 INFO L117 LiptonReduction]: Number of co-enabled transitions 962 [2020-10-16 01:34:59,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:34:59,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:34:59,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:34:59,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:34:59,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:34:59,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:34:59,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 4, 2, 1] term [2020-10-16 01:34:59,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:34:59,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 12, 2, 11, 2, 10, 4, 8, 4, 5, 4, 1] term [2020-10-16 01:34:59,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:34:59,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:34:59,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:34:59,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:34:59,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:34:59,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:34:59,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:34:59,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:34:59,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:34:59,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:34:59,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:34:59,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:34:59,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 5, 4, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:34:59,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:34:59,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:34:59,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:34:59,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 7, 2, 6, 2, 6, 2, 7, 4, 5, 4, 1] term [2020-10-16 01:34:59,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:34:59,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:34:59,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:34:59,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:34:59,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:00,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:00,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:00,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:00,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:00,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-16 01:35:00,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:35:00,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:00,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:00,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:35:00,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:35:00,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:35:00,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 01:35:00,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:00,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 12, 2, 11, 2, 10, 4, 8, 4, 3, 1] term [2020-10-16 01:35:00,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:00,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:00,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:00,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:00,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:00,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:00,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:04,860 WARN L193 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-16 01:35:04,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 4, 3, 2, 1] term [2020-10-16 01:35:04,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:04,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:04,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:04,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:04,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:04,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:04,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:04,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:04,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:04,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:04,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,425 WARN L193 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-16 01:35:06,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:06,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:06,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:06,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:06,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:06,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:06,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:06,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:06,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:06,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:06,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:06,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:06,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:06,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 5, 4, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:06,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:06,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 7, 2, 6, 2, 6, 2, 7, 4, 5, 4, 1] term [2020-10-16 01:35:06,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 4, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:35:06,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:06,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:06,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 4, 2, 5, 4, 6, 4, 6, 4, 5, 4, 1] term [2020-10-16 01:35:06,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:35:06,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 12, 2, 11, 2, 10, 4, 8, 4, 5, 4, 1] term [2020-10-16 01:35:06,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:06,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-16 01:35:06,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:35:06,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:06,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:06,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:06,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:06,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:06,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:06,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:06,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:06,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:06,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:06,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:07,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:07,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:07,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:35:07,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:07,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:07,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:07,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:07,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:07,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:07,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:07,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:07,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 4, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 4, 9, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 4, 8, 3, 9, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-10-16 01:35:07,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:07,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:07,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:07,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:07,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:07,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:07,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:35:07,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:07,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:07,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:07,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:07,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:07,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:08,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:08,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:08,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:08,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:08,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:08,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 01:35:08,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 4, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 4, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:08,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,508 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-16 01:35:08,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:35:08,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:08,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,625 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 01:35:08,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 2, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:35:08,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:35:08,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-16 01:35:08,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:08,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:08,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:08,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:08,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:08,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:08,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:08,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:08,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-16 01:35:08,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:35:08,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 5, 2, 5, 2, 3, 4, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:08,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:08,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:08,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 2, 1] term [2020-10-16 01:35:08,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 2, 1] term [2020-10-16 01:35:08,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:08,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:08,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:08,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:08,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:09,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:35:09,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 1] term [2020-10-16 01:35:09,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 2, 2, 5, 2, 5, 4, 3, 4, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:09,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:09,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:35:09,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-16 01:35:09,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:35:09,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:09,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:09,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 2, 2, 2, 1] term [2020-10-16 01:35:09,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:09,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:09,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:09,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:09,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:35:09,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,663 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-16 01:35:09,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:09,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:09,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:09,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:09,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:09,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:09,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:35:09,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:09,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:09,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:09,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:10,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:10,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:10,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 5, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:10,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:35:10,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:10,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:35:10,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:10,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:10,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:35:10,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:35:10,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:10,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:10,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:10,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:10,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:10,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:35:10,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:35:10,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:10,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:10,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:35:10,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:10,574 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-16 01:35:10,708 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-16 01:35:11,343 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2020-10-16 01:35:11,586 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-16 01:35:11,592 INFO L132 LiptonReduction]: Checked pairs total: 2688 [2020-10-16 01:35:11,592 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 01:35:11,595 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12708 [2020-10-16 01:35:11,604 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 01:35:11,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:11,605 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:11,606 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:11,606 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1670026931, now seen corresponding path program 1 times [2020-10-16 01:35:11,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:11,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281754474] [2020-10-16 01:35:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:11,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281754474] [2020-10-16 01:35:11,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:11,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:35:11,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777020575] [2020-10-16 01:35:11,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:35:11,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:35:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:35:11,932 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 187 [2020-10-16 01:35:11,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states. [2020-10-16 01:35:11,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:11,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 187 [2020-10-16 01:35:11,936 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:11,964 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 01:35:11,964 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:11,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:35:11,966 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2020-10-16 01:35:11,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 19 transitions, 53 flow [2020-10-16 01:35:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:35:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:35:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2020-10-16 01:35:11,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9162210338680927 [2020-10-16 01:35:11,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2020-10-16 01:35:11,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2020-10-16 01:35:11,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:11,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2020-10-16 01:35:11,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:35:12,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:35:12,004 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:35:12,006 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 514 transitions. [2020-10-16 01:35:12,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 19 transitions, 53 flow [2020-10-16 01:35:12,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 19 transitions, 50 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:35:12,012 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2020-10-16 01:35:12,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2020-10-16 01:35:12,016 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2020-10-16 01:35:12,016 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2020-10-16 01:35:12,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:35:12,016 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:12,016 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:12,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:35:12,017 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -469989147, now seen corresponding path program 1 times [2020-10-16 01:35:12,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:12,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993092939] [2020-10-16 01:35:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:12,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993092939] [2020-10-16 01:35:12,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:12,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:35:12,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260610099] [2020-10-16 01:35:12,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:35:12,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:35:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:35:12,201 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2020-10-16 01:35:12,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states. [2020-10-16 01:35:12,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:12,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2020-10-16 01:35:12,202 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:12,219 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 01:35:12,220 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 01:35:12,220 INFO L80 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 19 events. 0/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:35:12,220 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2020-10-16 01:35:12,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 19 transitions, 58 flow [2020-10-16 01:35:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:35:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:35:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2020-10-16 01:35:12,223 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8841354723707665 [2020-10-16 01:35:12,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2020-10-16 01:35:12,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2020-10-16 01:35:12,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:12,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2020-10-16 01:35:12,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:35:12,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:35:12,227 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:35:12,227 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 496 transitions. [2020-10-16 01:35:12,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 19 transitions, 58 flow [2020-10-16 01:35:12,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 19 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:35:12,228 INFO L241 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2020-10-16 01:35:12,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2020-10-16 01:35:12,229 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2020-10-16 01:35:12,229 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2020-10-16 01:35:12,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:35:12,229 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:12,229 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:12,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:35:12,230 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1984305814, now seen corresponding path program 1 times [2020-10-16 01:35:12,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:12,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240113379] [2020-10-16 01:35:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:12,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240113379] [2020-10-16 01:35:12,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:12,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:12,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948187726] [2020-10-16 01:35:12,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:12,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:12,601 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 187 [2020-10-16 01:35:12,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand 6 states. [2020-10-16 01:35:12,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:12,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 187 [2020-10-16 01:35:12,602 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:12,876 INFO L129 PetriNetUnfolder]: 38/99 cut-off events. [2020-10-16 01:35:12,876 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-16 01:35:12,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 99 events. 38/99 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 373 event pairs, 8 based on Foata normal form. 2/99 useless extension candidates. Maximal degree in co-relation 213. Up to 49 conditions per place. [2020-10-16 01:35:12,879 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 13 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2020-10-16 01:35:12,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 109 flow [2020-10-16 01:35:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:35:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:35:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2020-10-16 01:35:12,884 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6925133689839572 [2020-10-16 01:35:12,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2020-10-16 01:35:12,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2020-10-16 01:35:12,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:12,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2020-10-16 01:35:12,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:35:12,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:35:12,889 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:35:12,890 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 4 states and 518 transitions. [2020-10-16 01:35:12,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 109 flow [2020-10-16 01:35:12,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 103 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:35:12,891 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 74 flow [2020-10-16 01:35:12,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2020-10-16 01:35:12,892 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2020-10-16 01:35:12,892 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 74 flow [2020-10-16 01:35:12,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:12,892 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:12,892 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:12,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:35:12,892 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1534108666, now seen corresponding path program 1 times [2020-10-16 01:35:12,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:12,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461224104] [2020-10-16 01:35:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:13,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461224104] [2020-10-16 01:35:13,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:13,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:35:13,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542197332] [2020-10-16 01:35:13,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:35:13,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:35:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:35:13,090 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2020-10-16 01:35:13,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 74 flow. Second operand 4 states. [2020-10-16 01:35:13,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:13,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2020-10-16 01:35:13,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:13,170 INFO L129 PetriNetUnfolder]: 35/94 cut-off events. [2020-10-16 01:35:13,170 INFO L130 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2020-10-16 01:35:13,171 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 94 events. 35/94 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 367 event pairs, 14 based on Foata normal form. 10/100 useless extension candidates. Maximal degree in co-relation 198. Up to 56 conditions per place. [2020-10-16 01:35:13,172 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 7 selfloop transitions, 7 changer transitions 2/31 dead transitions. [2020-10-16 01:35:13,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 126 flow [2020-10-16 01:35:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:35:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:35:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2020-10-16 01:35:13,177 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8695187165775401 [2020-10-16 01:35:13,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 813 transitions. [2020-10-16 01:35:13,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 813 transitions. [2020-10-16 01:35:13,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:13,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 813 transitions. [2020-10-16 01:35:13,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:35:13,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:35:13,181 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:35:13,181 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 74 flow. Second operand 5 states and 813 transitions. [2020-10-16 01:35:13,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 126 flow [2020-10-16 01:35:13,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:35:13,186 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 125 flow [2020-10-16 01:35:13,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 01:35:13,186 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2020-10-16 01:35:13,187 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 125 flow [2020-10-16 01:35:13,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:35:13,187 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:13,187 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:13,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:35:13,187 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1251666784, now seen corresponding path program 1 times [2020-10-16 01:35:13,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:13,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852773901] [2020-10-16 01:35:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:13,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852773901] [2020-10-16 01:35:13,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:13,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:13,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454895606] [2020-10-16 01:35:13,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:35:13,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:35:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:35:13,339 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2020-10-16 01:35:13,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 125 flow. Second operand 5 states. [2020-10-16 01:35:13,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:13,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2020-10-16 01:35:13,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:13,434 INFO L129 PetriNetUnfolder]: 23/79 cut-off events. [2020-10-16 01:35:13,434 INFO L130 PetriNetUnfolder]: For 87/118 co-relation queries the response was YES. [2020-10-16 01:35:13,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 79 events. 23/79 cut-off events. For 87/118 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 302 event pairs, 2 based on Foata normal form. 27/103 useless extension candidates. Maximal degree in co-relation 269. Up to 52 conditions per place. [2020-10-16 01:35:13,436 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 5 selfloop transitions, 13 changer transitions 4/37 dead transitions. [2020-10-16 01:35:13,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 227 flow [2020-10-16 01:35:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:35:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:35:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1137 transitions. [2020-10-16 01:35:13,441 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.868601986249045 [2020-10-16 01:35:13,441 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1137 transitions. [2020-10-16 01:35:13,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1137 transitions. [2020-10-16 01:35:13,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:13,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1137 transitions. [2020-10-16 01:35:13,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:35:13,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:35:13,447 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:35:13,447 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 125 flow. Second operand 7 states and 1137 transitions. [2020-10-16 01:35:13,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 227 flow [2020-10-16 01:35:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:35:13,450 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 209 flow [2020-10-16 01:35:13,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2020-10-16 01:35:13,451 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2020-10-16 01:35:13,451 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 209 flow [2020-10-16 01:35:13,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:35:13,451 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:13,451 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:13,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:35:13,452 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash -722717402, now seen corresponding path program 1 times [2020-10-16 01:35:13,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:13,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384280851] [2020-10-16 01:35:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:13,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384280851] [2020-10-16 01:35:13,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:13,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:35:13,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235852799] [2020-10-16 01:35:13,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:35:13,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:35:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:35:13,517 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2020-10-16 01:35:13,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 209 flow. Second operand 4 states. [2020-10-16 01:35:13,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:13,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2020-10-16 01:35:13,518 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:13,560 INFO L129 PetriNetUnfolder]: 32/123 cut-off events. [2020-10-16 01:35:13,560 INFO L130 PetriNetUnfolder]: For 301/322 co-relation queries the response was YES. [2020-10-16 01:35:13,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 123 events. 32/123 cut-off events. For 301/322 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 605 event pairs, 4 based on Foata normal form. 7/119 useless extension candidates. Maximal degree in co-relation 486. Up to 82 conditions per place. [2020-10-16 01:35:13,562 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 5 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2020-10-16 01:35:13,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 228 flow [2020-10-16 01:35:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:35:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:35:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2020-10-16 01:35:13,565 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8663101604278075 [2020-10-16 01:35:13,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2020-10-16 01:35:13,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2020-10-16 01:35:13,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:13,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2020-10-16 01:35:13,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:35:13,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:35:13,569 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:35:13,569 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 209 flow. Second operand 4 states and 648 transitions. [2020-10-16 01:35:13,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 228 flow [2020-10-16 01:35:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 198 flow, removed 11 selfloop flow, removed 2 redundant places. [2020-10-16 01:35:13,574 INFO L241 Difference]: Finished difference. Result has 50 places, 34 transitions, 192 flow [2020-10-16 01:35:13,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2020-10-16 01:35:13,575 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2020-10-16 01:35:13,575 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 192 flow [2020-10-16 01:35:13,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:35:13,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:13,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:13,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:35:13,576 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 838491444, now seen corresponding path program 2 times [2020-10-16 01:35:13,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:13,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61751218] [2020-10-16 01:35:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:13,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61751218] [2020-10-16 01:35:13,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:13,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:35:13,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881677161] [2020-10-16 01:35:13,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:35:13,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:35:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:35:13,711 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 187 [2020-10-16 01:35:13,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 192 flow. Second operand 5 states. [2020-10-16 01:35:13,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:13,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 187 [2020-10-16 01:35:13,712 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:13,921 INFO L129 PetriNetUnfolder]: 89/294 cut-off events. [2020-10-16 01:35:13,921 INFO L130 PetriNetUnfolder]: For 788/833 co-relation queries the response was YES. [2020-10-16 01:35:13,922 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 294 events. 89/294 cut-off events. For 788/833 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1830 event pairs, 23 based on Foata normal form. 23/298 useless extension candidates. Maximal degree in co-relation 1031. Up to 92 conditions per place. [2020-10-16 01:35:13,924 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 10 selfloop transitions, 5 changer transitions 7/45 dead transitions. [2020-10-16 01:35:13,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 299 flow [2020-10-16 01:35:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:35:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:35:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2020-10-16 01:35:13,928 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2020-10-16 01:35:13,928 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2020-10-16 01:35:13,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2020-10-16 01:35:13,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:13,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2020-10-16 01:35:13,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:35:13,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:35:13,933 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:35:13,933 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 192 flow. Second operand 6 states and 867 transitions. [2020-10-16 01:35:13,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 299 flow [2020-10-16 01:35:13,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:35:13,940 INFO L241 Difference]: Finished difference. Result has 57 places, 36 transitions, 229 flow [2020-10-16 01:35:13,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2020-10-16 01:35:13,941 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2020-10-16 01:35:13,941 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 229 flow [2020-10-16 01:35:13,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:35:13,941 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:13,942 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:13,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:35:13,942 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 298586672, now seen corresponding path program 3 times [2020-10-16 01:35:13,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:13,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845178086] [2020-10-16 01:35:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:14,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845178086] [2020-10-16 01:35:14,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:14,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:35:14,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110627838] [2020-10-16 01:35:14,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:14,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:14,053 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2020-10-16 01:35:14,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 229 flow. Second operand 6 states. [2020-10-16 01:35:14,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:14,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2020-10-16 01:35:14,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:14,177 INFO L129 PetriNetUnfolder]: 28/122 cut-off events. [2020-10-16 01:35:14,177 INFO L130 PetriNetUnfolder]: For 896/1121 co-relation queries the response was YES. [2020-10-16 01:35:14,178 INFO L80 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 122 events. 28/122 cut-off events. For 896/1121 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 619 event pairs, 3 based on Foata normal form. 123/236 useless extension candidates. Maximal degree in co-relation 482. Up to 47 conditions per place. [2020-10-16 01:35:14,179 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 2 selfloop transitions, 15 changer transitions 6/38 dead transitions. [2020-10-16 01:35:14,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 38 transitions, 286 flow [2020-10-16 01:35:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:35:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:35:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1455 transitions. [2020-10-16 01:35:14,184 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8645276292335116 [2020-10-16 01:35:14,185 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1455 transitions. [2020-10-16 01:35:14,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1455 transitions. [2020-10-16 01:35:14,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:14,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1455 transitions. [2020-10-16 01:35:14,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:35:14,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:35:14,193 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:35:14,193 INFO L185 Difference]: Start difference. First operand has 57 places, 36 transitions, 229 flow. Second operand 9 states and 1455 transitions. [2020-10-16 01:35:14,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 38 transitions, 286 flow [2020-10-16 01:35:14,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 38 transitions, 261 flow, removed 5 selfloop flow, removed 8 redundant places. [2020-10-16 01:35:14,197 INFO L241 Difference]: Finished difference. Result has 58 places, 32 transitions, 216 flow [2020-10-16 01:35:14,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=32} [2020-10-16 01:35:14,198 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2020-10-16 01:35:14,198 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 216 flow [2020-10-16 01:35:14,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:14,198 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:14,198 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:14,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:35:14,198 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488350, now seen corresponding path program 1 times [2020-10-16 01:35:14,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:14,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793796690] [2020-10-16 01:35:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:35:14,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:35:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:35:14,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:35:14,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:35:14,373 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:35:14,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:35:14,375 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:35:14,399 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1507] [1507] L3-->L855: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In218316194 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In218316194 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In218316194 256) 0)) (.cse10 (= (mod ~x$r_buff0_thd0~0_In218316194 256) 0))) (let ((.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse2 (or .cse9 .cse10)) (.cse4 (not .cse7)) (.cse5 (not .cse8)) (.cse3 (or .cse7 .cse8))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out218316194 0)) (= ~x$r_buff0_thd0~0_In218316194 ~x$r_buff0_thd0~0_Out218316194) (or (and .cse0 (= ~x$w_buff0_used~0_Out218316194 0) .cse1) (and .cse2 (= ~x$w_buff0_used~0_In218316194 ~x$w_buff0_used~0_Out218316194))) (or (and .cse3 (= ~x$w_buff1_used~0_In218316194 ~x$w_buff1_used~0_Out218316194)) (and (= ~x$w_buff1_used~0_Out218316194 0) .cse4 .cse5)) (let ((.cse6 (select |#memory_int_In218316194| |~#x~0.base_In218316194|))) (or (and .cse0 (= (store |#memory_int_In218316194| |~#x~0.base_In218316194| (store .cse6 |~#x~0.offset_In218316194| ~x$w_buff0~0_In218316194)) |#memory_int_Out218316194|) .cse1) (and .cse2 (or (and .cse4 (= (store |#memory_int_In218316194| |~#x~0.base_In218316194| (store .cse6 |~#x~0.offset_In218316194| ~x$w_buff1~0_In218316194)) |#memory_int_Out218316194|) .cse5) (and (= |#memory_int_Out218316194| (store |#memory_int_In218316194| |~#x~0.base_In218316194| (store .cse6 |~#x~0.offset_In218316194| (select .cse6 |~#x~0.offset_In218316194|)))) .cse3))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In218316194| ULTIMATE.start_assume_abort_if_not_~cond_Out218316194) (= ~x$r_buff1_thd0~0_In218316194 ~x$r_buff1_thd0~0_Out218316194)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In218316194, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In218316194, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In218316194|, ~#x~0.offset=|~#x~0.offset_In218316194|, ~x$w_buff1~0=~x$w_buff1~0_In218316194, #memory_int=|#memory_int_In218316194|, ~#x~0.base=|~#x~0.base_In218316194|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In218316194, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In218316194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In218316194} OutVars{~x$w_buff0~0=~x$w_buff0~0_In218316194, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out218316194, ~#x~0.offset=|~#x~0.offset_In218316194|, ~x$w_buff1~0=~x$w_buff1~0_In218316194, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out218316194, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out218316194, ULTIMATE.start_main_#t~ite89=|ULTIMATE.start_main_#t~ite89_Out218316194|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out218316194, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In218316194|, ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out218316194|, ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out218316194|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out218316194, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out218316194|, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out218316194|, ULTIMATE.start_main_#t~ite90=|ULTIMATE.start_main_#t~ite90_Out218316194|, #memory_int=|#memory_int_Out218316194|, ~#x~0.base=|~#x~0.base_In218316194|, ULTIMATE.start_main_#t~mem88=|ULTIMATE.start_main_#t~mem88_Out218316194|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite89, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, #memory_int, ULTIMATE.start_main_#t~mem88] because there is no mapped edge [2020-10-16 01:35:14,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,425 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,425 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:14,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:14,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:35:14 BasicIcfg [2020-10-16 01:35:14,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:35:14,532 INFO L168 Benchmark]: Toolchain (without parser) took 20427.17 ms. Allocated memory was 248.5 MB in the beginning and 653.8 MB in the end (delta: 405.3 MB). Free memory was 202.9 MB in the beginning and 248.4 MB in the end (delta: -45.5 MB). Peak memory consumption was 359.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,533 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.27 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 202.9 MB in the beginning and 256.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.22 ms. Allocated memory is still 306.7 MB. Free memory was 256.1 MB in the beginning and 253.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,535 INFO L168 Benchmark]: Boogie Preprocessor took 46.34 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,536 INFO L168 Benchmark]: RCFGBuilder took 3526.66 ms. Allocated memory was 306.7 MB in the beginning and 431.5 MB in the end (delta: 124.8 MB). Free memory was 251.1 MB in the beginning and 365.4 MB in the end (delta: -114.3 MB). Peak memory consumption was 164.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,537 INFO L168 Benchmark]: TraceAbstraction took 15910.48 ms. Allocated memory was 431.5 MB in the beginning and 653.8 MB in the end (delta: 222.3 MB). Free memory was 365.4 MB in the beginning and 248.4 MB in the end (delta: 117.0 MB). Peak memory consumption was 339.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:14,541 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.46 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 867.27 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 202.9 MB in the beginning and 256.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.22 ms. Allocated memory is still 306.7 MB. Free memory was 256.1 MB in the beginning and 253.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.34 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3526.66 ms. Allocated memory was 306.7 MB in the beginning and 431.5 MB in the end (delta: 124.8 MB). Free memory was 251.1 MB in the beginning and 365.4 MB in the end (delta: -114.3 MB). Peak memory consumption was 164.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15910.48 ms. Allocated memory was 431.5 MB in the beginning and 653.8 MB in the end (delta: 222.3 MB). Free memory was 365.4 MB in the beginning and 248.4 MB in the end (delta: 117.0 MB). Peak memory consumption was 339.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 619 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.6s, 104 PlacesBefore, 29 PlacesAfterwards, 95 TransitionsBefore, 19 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 2688 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L702] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L703] 0 int __unbuffered_p0_EAX$mem_tmp; [L704] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L712] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L713] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 int __unbuffered_p0_EAX$w_buff0; [L715] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L716] 0 int __unbuffered_p0_EAX$w_buff1; [L717] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L719] 0 int __unbuffered_p0_EBX = 0; [L721] 0 int __unbuffered_p1_EAX = 0; [L723] 0 int __unbuffered_p1_EBX = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L728] 0 _Bool x$flush_delayed; [L729] 0 int x$mem_tmp; [L730] 0 _Bool x$r_buff0_thd0; [L731] 0 _Bool x$r_buff0_thd1; [L732] 0 _Bool x$r_buff0_thd2; [L733] 0 _Bool x$r_buff0_thd3; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice1; [L748] 0 _Bool weak$$choice2; [L839] 0 pthread_t t1737; [L840] FCALL, FORK 0 pthread_create(&t1737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L753] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L754] 1 x$flush_delayed = weak$$choice2 [L755] EXPR 1 \read(x) [L755] 1 x$mem_tmp = x [L756] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L757] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L757] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L757] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L760] EXPR 1 !x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L761] EXPR 1 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L765] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L766] EXPR 1 \read(x) [L766] 1 __unbuffered_p0_EAX = x [L767] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L767] 1 x = x$flush_delayed ? x$mem_tmp : x [L768] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L841] 0 pthread_t t1738; [L842] FCALL, FORK 0 pthread_create(&t1738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L793] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L793] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L794] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L794] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L795] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L795] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L796] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L796] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L796] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L796] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L797] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L797] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L798] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L798] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L798] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L799] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 2 \read(x) [L800] 2 __unbuffered_p1_EBX = x [L801] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L801] 2 x = x$flush_delayed ? x$mem_tmp : x [L802] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L843] 0 pthread_t t1739; [L844] FCALL, FORK 0 pthread_create(&t1739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L814] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L858] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L858] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L858] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L858] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.7s, HoareTripleCheckerStatistics: 26 SDtfs, 18 SDslu, 14 SDs, 0 SdLazy, 173 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 11354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...